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 23, 2026 00:37Kevin HeaveyKevin HeaveyScore: 3,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 00:403,37438,152,69326,891,0001,114,0002,113,536
2Sep 23, 2026 00:403,38639,167,07126,906,0001,203,0002,113,536
3Sep 23, 2026 00:403,38838,410,19226,940,0001,186,0002,113,536
4Sep 23, 2026 00:403,39039,485,58526,923,0001,222,0002,117,632
5Sep 23, 2026 00:403,39238,864,01826,958,0001,196,0002,113,536
6Sep 23, 2026 00:403,39339,140,70426,978,0001,187,0002,113,536
7Sep 23, 2026 00:403,39638,413,42927,006,0001,188,0002,113,536
8Sep 23, 2026 00:403,39739,194,36627,024,0001,173,0002,113,536
9Sep 23, 2026 00:403,40638,561,44527,247,0001,023,0002,113,536