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 11, 2026 15:12Victor MerckléVictor MerckléScore: 3,633Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 15:183,55038,167,25128,328,0001,137,00024,576stderr
2Sep 11, 2026 15:183,58638,432,55728,571,0001,193,00024,576stderr
3Sep 11, 2026 15:183,61538,687,95828,790,0001,218,00024,576stderr
4Sep 11, 2026 15:183,61838,703,41528,835,0001,196,00024,576stderr
5Sep 11, 2026 15:183,63338,868,04128,920,0001,236,00024,576stderr
6Sep 11, 2026 15:183,63838,942,81229,180,0001,020,00024,576stderr
7Sep 11, 2026 15:183,66839,162,62129,390,0001,062,00024,576stderr
8Sep 11, 2026 15:183,67039,838,84529,318,0001,151,0002,117,632stderr
9Sep 11, 2026 15:183,67439,159,40629,477,0001,022,0002,117,632stderr