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 18, 2026 00:17Daniel MastalerzDaniel MastalerzScore: 6,270Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 00:176,24482,660,99747,837,0003,986,0002,314,240
2Feb 18, 2026 00:176,25580,387,60448,923,0002,995,0002,265,088
3Feb 18, 2026 00:176,25874,049,32148,946,0002,996,0002,269,184
4Feb 18, 2026 00:176,26275,307,42647,980,0003,998,0002,322,432
5Feb 18, 2026 00:176,26774,893,39448,012,0004,001,0002,265,088
6Feb 18, 2026 00:176,26775,150,87648,014,0004,001,0002,273,280
7Feb 18, 2026 00:176,27078,524,07648,038,0004,003,0002,326,528
8Feb 18, 2026 00:176,27679,358,18748,081,0004,006,0002,326,528
9Feb 18, 2026 00:176,29075,080,87448,188,0004,015,0002,326,528
10Feb 18, 2026 00:176,40381,115,42449,133,0004,010,0002,318,336
11Feb 18, 2026 00:176,41976,228,25751,268,0002,010,0002,310,144
12Feb 18, 2026 00:176,44074,700,39051,436,0002,017,0002,265,088