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 21, 2026 09:41Daniel MastalerzDaniel MastalerzScore: 7,972Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 09:417,91695,870,42456,744,0008,959,0002,416,640
2Feb 21, 2026 09:417,94487,551,67757,943,0007,992,0002,523,136
3Feb 21, 2026 09:417,96692,427,88960,110,0006,011,0002,265,088
4Feb 21, 2026 09:417,97286,836,61857,148,0009,023,0002,297,856
5Feb 21, 2026 09:418,01592,846,75759,471,0007,055,0002,322,432
6Feb 21, 2026 09:418,05793,411,73157,890,0008,982,0002,297,856