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 13, 2026 18:56Victor MerckléVictor MerckléScore: 76,786Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 18:5676,703645,281,309635,523,0001,117,0002,117,632stderr
2May 13, 2026 18:5676,719646,223,593635,641,0001,129,0002,121,728stderr
3May 13, 2026 18:5676,745645,841,866635,861,0001,125,0002,117,632stderr
4May 13, 2026 18:5676,785644,615,162636,189,0001,133,0002,117,632stderr
5May 13, 2026 18:5676,786647,146,587636,318,0001,013,0002,117,632stderr
6May 13, 2026 18:5676,827647,982,888636,497,0001,168,0002,117,632stderr
7May 13, 2026 18:5676,847647,937,934636,722,0001,109,0002,117,632stderr
8May 13, 2026 18:5677,277649,749,231640,400,0001,002,0002,117,632stderr
9May 13, 2026 18:5677,314651,706,874640,667,0001,045,0002,117,632stderr