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 12:09Kevin HeaveyKevin HeaveyScore: 3,539Success
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 12:103,50839,149,90027,897,0001,227,0002,113,536
2Sep 6, 2026 12:103,51438,906,37627,929,0001,243,0002,113,536
3Sep 6, 2026 12:103,52039,122,33828,179,0001,043,0002,113,536
4Sep 6, 2026 12:103,52939,398,97328,217,0001,075,0002,113,536
5Sep 6, 2026 12:103,53937,765,80728,161,0001,213,0002,113,536
6Sep 6, 2026 12:103,55339,698,69328,374,0001,117,0002,113,536
7Sep 6, 2026 12:103,65048,908,42529,067,0001,234,0002,113,536
8Sep 6, 2026 12:103,67540,405,70129,460,0001,046,0002,113,536
9Sep 6, 2026 12:103,81343,448,02930,448,0001,205,0002,113,536