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 15, 2026 23:22wnwnScore: 8,270Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 23:227,16181,675,31251,378,0008,059,0002,469,888
2Feb 15, 2026 23:227,21882,545,15851,921,0007,987,0002,465,792
3Feb 15, 2026 23:227,679109,769,56855,769,0007,967,0002,277,376
4Feb 15, 2026 23:228,27097,872,45261,578,0007,066,0002,449,408
5Feb 15, 2026 23:228,44698,336,81962,088,0008,011,0002,478,080
6Feb 15, 2026 23:228,48693,230,19363,390,0007,043,0002,473,984