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 14, 2026 09:21Victor MerckléVictor MerckléScore: 103,011Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 09:21102,920863,485,130853,238,0001,000,0002,117,632stderr
2May 14, 2026 09:21102,927862,495,080853,298,0001,002,0002,117,632stderr
3May 14, 2026 09:21102,980863,945,663853,734,0001,003,0002,117,632stderr
4May 14, 2026 09:21102,983865,105,877853,761,0001,003,0002,117,632stderr
5May 14, 2026 09:21103,011864,041,585853,994,0001,001,0002,117,632stderr
6May 14, 2026 09:21103,013863,757,386854,010,0001,001,0002,117,632stderr
7May 14, 2026 09:21103,014862,340,479854,018,0001,002,0002,117,632stderr
8May 14, 2026 09:21103,033862,693,990854,182,0001,000,0002,117,632stderr
9May 14, 2026 09:21107,479899,570,919891,080,0001,002,0002,117,632stderr