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 24, 2026 19:02Daniel MastalerzDaniel MastalerzScore: 5,621Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 19:025,54073,524,77741,983,0003,998,0002,523,136
2Feb 24, 2026 19:025,55271,686,82343,079,0003,005,0002,326,528
3Feb 24, 2026 19:025,59775,275,05343,426,0003,029,0002,273,280
4Feb 24, 2026 19:025,62176,864,96343,611,0003,042,0002,326,528
5Feb 24, 2026 19:025,63779,123,04442,807,0003,982,0002,301,952
6Feb 24, 2026 19:025,64173,155,53843,832,0002,988,0002,260,992