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 20:05Daniel MastalerzDaniel MastalerzScore: 5,615Success
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 20:055,51972,644,16141,827,0003,983,0002,514,944
2Feb 24, 2026 20:055,52968,713,44541,904,0003,990,0002,523,136
3Feb 24, 2026 20:055,55080,323,50742,058,0004,005,0002,326,528
4Feb 24, 2026 20:055,61578,386,79344,578,0002,026,0002,260,992
5Feb 24, 2026 20:055,63572,987,12043,789,0002,985,0002,318,336
6Feb 24, 2026 20:055,65271,698,35442,923,0003,992,0002,306,048