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 18:58Daniel MastalerzDaniel MastalerzScore: 7,153Success
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 18:587,02284,606,33854,262,0004,019,0002,285,568
2Feb 24, 2026 18:587,02681,082,21655,302,0003,016,0002,289,664
3Feb 24, 2026 18:587,04987,911,83455,478,0003,026,0002,326,528
4Feb 24, 2026 18:587,15385,558,64555,342,0004,024,0002,519,040
5Feb 24, 2026 18:587,18889,575,01056,679,0002,983,0002,318,336
6Feb 24, 2026 18:587,21684,679,85255,900,0003,992,0002,318,336