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 listMay 24, 2026 20:03Maya RebholzMaya RebholzScore: 7,319Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 20:047,16369,945,31253,937,0005,521,0002,117,632
2May 24, 2026 20:047,25389,129,24454,504,0005,702,0002,117,632
3May 24, 2026 20:047,25871,353,24154,712,0005,532,0002,113,536
4May 24, 2026 20:047,26983,580,80854,330,0006,004,0002,117,632
5May 24, 2026 20:047,31970,823,92055,355,0005,394,0002,113,536
6May 24, 2026 20:047,32270,715,64655,113,0005,667,0002,117,632
7May 24, 2026 20:047,37085,660,80355,316,0005,861,0002,113,536
8May 24, 2026 20:047,38372,838,29855,853,0005,432,0002,117,632
9May 24, 2026 20:047,53574,216,55256,876,0005,669,0002,113,536