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 26, 2026 20:42Victor MerckléVictor MerckléScore: 7,644Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 20:437,60171,290,44561,932,0001,162,0002,113,536
2Aug 26, 2026 20:437,61671,347,88362,062,0001,153,0002,113,536
3Aug 26, 2026 20:437,63771,826,02562,288,0001,104,0002,113,536
4Aug 26, 2026 20:437,63971,663,81362,277,0001,129,0002,113,536
5Aug 26, 2026 20:437,64471,822,09262,300,0001,150,0002,113,536
6Aug 26, 2026 20:437,65771,801,78562,427,0001,130,0002,113,536
7Aug 26, 2026 20:437,69072,104,93262,730,0001,105,0002,113,536
8Aug 26, 2026 20:437,76573,544,13863,303,0001,154,0002,113,536
9Aug 26, 2026 20:437,85374,177,40964,116,0001,067,0002,113,536