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 21:22Daniel MastalerzDaniel MastalerzScore: 5,956Success
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 21:225,91672,731,41445,091,0004,008,0002,523,136
2Feb 19, 2026 21:225,92672,006,86746,176,0003,011,0002,326,528
3Feb 19, 2026 21:225,92778,146,62646,183,0003,011,0002,269,184
4Feb 19, 2026 21:225,93374,728,08247,238,0002,010,0002,400,256
5Feb 19, 2026 21:225,94476,108,79645,307,0004,027,0002,375,680
6Feb 19, 2026 21:225,95671,982,13546,407,0003,026,0002,523,136
7Feb 19, 2026 21:225,95670,639,19347,417,0002,017,0002,265,088
8Feb 19, 2026 21:225,95873,067,21045,416,0004,037,0002,326,528
9Feb 19, 2026 21:225,97475,475,64546,550,0003,035,0002,285,568
10Feb 19, 2026 21:226,03876,007,49047,108,0003,006,0002,273,280
11Feb 19, 2026 21:226,04080,706,22346,119,0004,010,0002,260,992
12Feb 19, 2026 21:226,04275,280,44346,138,0004,012,0002,265,088