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 17, 2026 17:39wnwnScore: 7,749Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 17:396,72877,925,83152,855,0002,991,0002,506,752
2Feb 17, 2026 17:396,89779,626,86751,216,0006,025,0002,478,080
3Feb 17, 2026 17:396,94693,569,86554,621,0003,034,0002,469,888
4Feb 17, 2026 17:397,74986,136,04361,299,0003,014,0002,437,120
5Feb 17, 2026 17:397,81385,262,63861,855,0002,992,0002,433,024
6Feb 17, 2026 17:398,12590,692,46063,411,0004,026,0002,420,736