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 16, 2026 17:42Daniel MastalerzDaniel MastalerzScore: 7,843Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 17:427,70094,816,30260,918,0002,995,0002,375,680
2Feb 16, 2026 17:427,76186,980,15561,400,0003,019,0002,514,944
3Feb 16, 2026 17:427,77092,734,59862,478,0002,015,0002,265,088
4Feb 16, 2026 17:427,84388,914,38562,094,0003,004,0002,281,472
5Feb 16, 2026 17:427,84690,754,38063,115,0002,003,0002,273,280
6Feb 16, 2026 17:427,90891,730,69863,620,0002,019,0002,293,760