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 19, 2026 20:09Daniel MastalerzDaniel MastalerzScore: 6,039Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 20:096,03174,973,80747,052,0003,003,0002,310,144
2Feb 19, 2026 20:096,03774,062,87446,099,0004,008,0002,269,184
3Feb 19, 2026 20:096,03872,549,14646,105,0004,009,0002,519,040
4Feb 19, 2026 20:096,03976,355,48547,119,0003,007,0002,519,040
5Feb 19, 2026 20:096,03971,891,27146,112,0004,009,0002,326,528
6Feb 19, 2026 20:096,04173,682,07348,133,0002,005,0002,375,680
7Feb 19, 2026 20:096,04575,131,82947,167,0003,010,0002,269,184
8Feb 19, 2026 20:096,05171,275,82447,207,0003,013,0002,326,528
9Feb 19, 2026 20:096,05472,952,40847,235,0003,015,0002,269,184