Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listSep 6, 2026 02:36CheckHarryCheckHarryScore: 4,333Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 02:364,17944,555,39433,675,0001,016,0002,113,536
2Sep 6, 2026 02:364,18244,588,22533,696,0001,015,0002,113,536
3Sep 6, 2026 02:364,24655,641,14734,134,0001,112,0002,113,536
4Sep 6, 2026 02:364,27045,341,11334,427,0001,018,0002,113,536
5Sep 6, 2026 02:364,33345,864,20134,949,0001,018,0002,113,536
6Sep 6, 2026 02:364,34245,942,59234,914,0001,129,0002,113,536
7Sep 6, 2026 02:364,37546,406,68235,292,0001,022,0002,113,536
8Sep 6, 2026 02:364,38646,361,88635,399,0001,009,0002,113,536
9Sep 6, 2026 02:364,52560,187,62336,508,0001,055,0002,113,536