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 14, 2026 13:14Kevin HeaveyKevin HeaveyScore: 3,658Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 13:153,54438,171,51628,384,0001,039,0002,113,536
2Sep 14, 2026 13:153,57838,293,00328,644,0001,058,0002,113,536
3Sep 14, 2026 13:153,63238,921,35628,958,0001,193,0002,113,536
4Sep 14, 2026 13:153,65839,140,71629,176,0001,190,0002,113,536
5Sep 14, 2026 13:153,65839,067,41929,143,0001,220,0002,113,536
6Sep 14, 2026 13:153,68339,349,44929,334,0001,235,0002,113,536
7Sep 14, 2026 13:153,81040,408,32430,429,0001,194,0002,113,536
8Sep 14, 2026 13:153,81640,408,45330,475,0001,204,0002,113,536
9Sep 14, 2026 13:153,83641,406,61430,638,0001,207,0002,113,536