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 25, 2026 19:36Daniel MastalerzDaniel MastalerzScore: 5,447Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 25, 2026 19:365,36768,622,57443,531,0001,012,0002,293,760
2Feb 25, 2026 19:365,37476,218,52142,580,0002,027,0002,416,640
3Feb 25, 2026 19:365,44173,502,01643,154,0002,007,0002,293,760
4Feb 25, 2026 19:365,44771,950,92642,196,0003,014,0002,285,568
5Feb 25, 2026 19:365,47769,427,23543,442,0002,020,0002,285,568
6Feb 25, 2026 19:365,50180,204,44744,643,0001,014,0002,285,568