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 8, 2026 16:36Victor MerckléVictor MerckléScore: 4,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 16:393,99141,621,53328,807,0004,320,00024,576stderr
2Sep 8, 2026 16:394,01741,898,40429,306,0004,041,00024,576stderr
3Sep 8, 2026 16:394,06643,023,71129,918,0003,838,00024,576stderr
4Sep 8, 2026 16:394,08642,460,16029,289,0004,629,00024,576stderr
5Sep 8, 2026 16:394,16843,160,27429,991,0004,605,00024,576stderr
6Sep 8, 2026 16:394,19945,006,64729,901,0004,957,0002,117,632stderr
7Sep 8, 2026 16:394,21143,596,88129,781,0005,177,0002,117,632stderr
8Sep 8, 2026 16:394,22043,567,26829,751,0005,277,0002,117,632stderr
9Sep 8, 2026 16:394,33044,519,82129,643,0006,300,00024,576stderr