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 listFeb 11, 2026 19:27olliecrowolliecrowScore: 6,494Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 19:276,12278,959,36446,828,0003,985,0002,371,584
2Feb 11, 2026 19:276,15882,603,79848,109,0003,006,0002,404,352
3Feb 11, 2026 19:276,16674,158,16848,165,0003,010,0002,396,160
4Feb 11, 2026 19:276,49475,441,75951,907,0001,996,0002,404,352
5Feb 11, 2026 19:276,51177,945,61350,036,0004,002,0002,473,984
6Feb 11, 2026 19:276,64886,927,28253,171,0002,006,0002,265,088