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 listFeb 8, 2026 05:57howenhowenScore: 93,637Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 8, 2026 05:5793,339801,767,202535,803,000238,912,0002,281,472
2Feb 8, 2026 05:5793,637800,392,572534,439,000242,745,0002,514,944
3Feb 8, 2026 05:5794,152804,394,864536,629,000244,830,0002,269,184