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 listAug 11, 2026 18:45Victor MerckléVictor MerckléScore: 5,668Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 18:465,65055,279,46245,880,0001,021,0002,117,632stderr
2Aug 11, 2026 18:465,65455,345,77445,925,0001,007,0002,117,632stderr
3Aug 11, 2026 18:465,65755,143,87245,841,0001,114,0002,117,632stderr
4Aug 11, 2026 18:465,65855,358,41445,880,0001,089,0002,117,632stderr
5Aug 11, 2026 18:465,66855,452,70045,961,0001,087,0002,117,632stderr
6Aug 11, 2026 18:465,67055,530,85345,988,0001,079,0002,117,632stderr
7Aug 11, 2026 18:465,67156,635,40245,879,0001,198,0002,117,632stderr
8Aug 11, 2026 18:465,67555,517,17846,100,0001,006,0002,117,632stderr
9Aug 11, 2026 18:465,69055,670,96546,123,0001,105,0002,117,632stderr