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 listMar 4, 2026 16:06caandocaandoScore: 5,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 16:065,72776,281,46946,527,0001,011,0002,514,944
2Mar 4, 2026 16:065,72968,819,29646,536,0001,011,0002,265,088
3Mar 4, 2026 16:065,73176,283,07747,565,00002,285,568
4Mar 4, 2026 16:065,84670,524,09747,510,0001,010,0002,285,568
5Mar 4, 2026 16:065,86473,390,14947,660,0001,014,0002,269,184
6Mar 4, 2026 16:065,86476,892,09347,658,0001,014,0002,285,568