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 1, 2026 06:26Victor MerckléVictor MerckléScore: 3,996Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 06:283,96541,282,86831,761,0001,149,0002,117,632stderr
2Sep 1, 2026 06:283,97251,504,20131,855,0001,116,0002,117,632stderr
3Sep 1, 2026 06:283,97841,431,89231,884,0001,136,0002,117,632stderr
4Sep 1, 2026 06:283,98041,494,57231,909,0001,125,0002,117,632stderr
5Sep 1, 2026 06:283,99641,664,02332,026,0001,141,0002,117,632stderr
6Sep 1, 2026 06:284,00142,314,07132,049,0001,165,0002,117,632stderr
7Sep 1, 2026 06:284,00948,027,76032,073,0001,205,0002,117,632stderr
8Sep 1, 2026 06:284,03649,865,54832,324,0001,181,0002,117,632stderr
9Sep 1, 2026 06:284,09243,087,94732,812,0001,152,0002,117,632stderr