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 20, 2026 16:50Daniel MastalerzDaniel MastalerzScore: 5,883Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 16:505,76872,934,95144,882,0002,992,0002,326,528
2Feb 20, 2026 16:505,78973,138,17945,046,0003,003,0002,273,280
3Feb 20, 2026 16:505,80171,218,68444,138,0004,012,0002,330,624
4Feb 20, 2026 16:505,88378,260,91845,838,0002,989,0002,265,088
5Feb 20, 2026 16:505,88972,993,81644,888,0003,990,0002,322,432
6Feb 20, 2026 16:505,89175,144,23444,904,0003,991,0002,523,136