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 18, 2026 03:35Daniel MastalerzDaniel MastalerzScore: 7,087Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 03:356,67977,646,83446,366,0009,071,0002,412,544
2Feb 18, 2026 03:356,72485,016,26947,838,0007,973,0002,400,256
3Feb 18, 2026 03:356,74978,646,77047,014,0009,002,0002,383,872
4Feb 18, 2026 03:357,08785,270,14950,846,0007,975,0002,506,752
5Feb 18, 2026 03:357,11383,296,18151,037,0008,005,0002,355,200
6Feb 18, 2026 03:357,22088,121,27852,938,0006,991,0002,338,816