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 00:24Daniel MastalerzDaniel MastalerzScore: 6,386Success
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 00:246,27776,715,20748,094,0004,007,0002,289,664
2Feb 18, 2026 00:246,29874,264,52149,260,0003,015,0002,330,624
3Feb 18, 2026 00:246,31278,688,18249,370,0003,022,0002,310,144
4Feb 18, 2026 00:246,38675,539,55249,003,0004,000,0002,322,432
5Feb 18, 2026 00:246,40179,199,03149,122,0004,009,0002,306,048
6Feb 18, 2026 00:246,42174,704,54750,275,0003,016,0002,514,944