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 23, 2026 08:22Kevin HeaveyKevin HeaveyScore: 3,240Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 08:243,21035,371,29425,547,0001,104,0002,113,536
2Sep 23, 2026 08:243,22035,517,80225,602,0001,124,0002,113,536
3Sep 23, 2026 08:243,23436,480,31025,687,0001,157,0002,113,536
4Sep 23, 2026 08:243,23736,454,48225,691,0001,178,0002,113,536
5Sep 23, 2026 08:243,24036,449,50825,876,0001,021,0002,113,536
6Sep 23, 2026 08:243,24836,604,24625,818,0001,147,0002,113,536
7Sep 23, 2026 08:243,25035,831,95525,953,0001,029,0002,113,536
8Sep 23, 2026 08:243,25535,864,67625,904,0001,114,0002,113,536
9Sep 23, 2026 08:243,86941,709,15131,077,0001,042,0002,113,536