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 listSep 17, 2026 21:36Victor MerckléVictor MerckléScore: 5,297Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 21:425,21653,233,09032,517,00010,776,0002,117,632stderr
2Sep 17, 2026 21:425,22153,210,32932,481,00010,860,00024,576stderr
3Sep 17, 2026 21:425,23053,338,94132,489,00010,921,00024,576stderr
4Sep 17, 2026 21:425,23753,388,63332,590,00010,881,00024,576stderr
5Sep 17, 2026 21:425,29754,360,58132,487,00011,479,0002,117,632stderr
6Sep 17, 2026 21:425,31053,958,53933,288,00010,785,00024,576stderr
7Sep 17, 2026 21:425,31054,473,49533,343,00010,734,0002,117,632stderr
8Sep 17, 2026 21:425,32154,635,39832,910,00011,262,0002,117,632stderr
9Sep 17, 2026 21:425,34554,264,45633,200,00011,166,0002,117,632stderr