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 4, 2026 09:21Teow Hua JunTeow Hua JunScore: 6,827Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 09:216,80966,674,02255,412,0001,105,0002,113,536
2Aug 4, 2026 09:216,81866,584,51155,473,0001,120,0002,113,536
3Aug 4, 2026 09:216,81966,691,62555,504,0001,095,0002,113,536
4Aug 4, 2026 09:216,82466,651,43455,510,0001,131,0002,113,536
5Aug 4, 2026 09:216,82766,687,33755,570,0001,102,0002,113,536
6Aug 4, 2026 09:216,83067,477,83555,540,0001,151,0002,113,536
7Aug 4, 2026 09:216,83366,776,09455,618,0001,097,0002,113,536
8Aug 4, 2026 09:216,83466,746,58655,582,0001,141,0002,113,536
9Aug 4, 2026 09:216,83967,597,46355,643,0001,126,0002,113,536