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 listJul 7, 2026 09:48Victor MerckléVictor MerckléScore: 5,490Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 09:485,44353,214,90344,057,0001,122,0002,117,632stderr
2Jul 7, 2026 09:485,45553,768,24444,255,0001,026,0002,117,632stderr
3Jul 7, 2026 09:485,46153,393,97044,223,0001,109,0002,117,632stderr
4Jul 7, 2026 09:485,47053,469,60944,397,0001,010,0002,117,632stderr
5Jul 7, 2026 09:485,49053,610,36544,540,0001,034,0002,117,632stderr
6Jul 7, 2026 09:485,49953,675,80944,635,0001,013,0002,117,632stderr
7Jul 7, 2026 09:485,51553,853,42144,670,0001,108,0002,117,632stderr
8Jul 7, 2026 09:485,59954,462,41745,434,0001,042,0002,117,632stderr
9Jul 7, 2026 09:485,61854,643,29245,519,0001,111,0002,117,632stderr