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 16, 2026 05:35Victor MerckléVictor MerckléScore: 6,960Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 05:366,95067,504,38757,691,00002,117,632stderr
2May 16, 2026 05:366,95366,740,98357,718,00002,117,632stderr
3May 16, 2026 05:366,95567,022,02957,733,00002,117,632stderr
4May 16, 2026 05:366,95865,361,21057,752,00002,117,632stderr
5May 16, 2026 05:366,96066,324,97556,744,0001,031,0002,117,632stderr
6May 16, 2026 05:366,96167,877,73156,761,0001,020,0002,117,632stderr
7May 16, 2026 05:366,96465,094,47856,793,0001,013,0002,117,632stderr
8May 16, 2026 05:367,00966,150,42357,152,0001,026,0002,117,632stderr
9May 16, 2026 05:367,18566,950,90759,637,00002,117,632stderr