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 listMay 10, 2026 04:24Josu San MartinJosu San MartinScore: 4,714Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 04:244,70256,342,76937,907,0001,125,0002,547,712
2May 10, 2026 04:244,70956,191,86337,923,0001,162,0002,547,712
3May 10, 2026 04:244,70956,888,73537,924,0001,167,0002,555,904
4May 10, 2026 04:244,71056,455,74437,988,0001,108,0002,551,808
5May 10, 2026 04:244,71453,994,36038,035,0001,094,0002,539,520
6May 10, 2026 04:244,73157,138,42038,248,0001,027,0002,551,808
7May 10, 2026 04:244,75256,585,10138,317,0001,128,0002,551,808
8May 10, 2026 04:244,76256,366,30838,499,0001,030,0002,551,808
9May 10, 2026 04:244,80157,167,55838,793,0001,060,0002,547,712