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:24Kevin HeaveyKevin HeaveyScore: 3,724Success
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:273,52837,807,31728,080,0001,204,0002,113,536
2Sep 6, 2026 12:273,53037,788,99228,264,0001,037,0002,113,536
3Sep 6, 2026 12:273,55138,017,90228,430,0001,048,0002,113,536
4Sep 6, 2026 12:273,60038,996,52528,678,0001,203,0002,113,536
5Sep 6, 2026 12:273,72440,094,24729,708,0001,202,0002,113,536
6Sep 6, 2026 12:273,75039,696,22029,928,0001,205,0002,113,536
7Sep 6, 2026 12:273,76140,470,66530,048,0001,176,0002,113,536
8Sep 6, 2026 12:273,76739,836,52930,245,0001,029,0002,113,536
9Sep 6, 2026 12:273,80840,830,16930,400,0001,213,0002,113,536