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 15, 2026 13:47Daniel MastalerzDaniel MastalerzScore: 6,785Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 13:476,66981,009,98852,336,0003,019,0002,269,184
2Feb 15, 2026 13:476,67983,891,49452,411,0003,023,0002,330,624
3Feb 15, 2026 13:476,69080,486,44452,501,0003,028,0002,265,088
4Feb 15, 2026 13:476,78580,814,93954,306,0002,011,0002,285,568
5Feb 15, 2026 13:476,79680,732,52253,383,0003,021,0002,285,568
6Feb 15, 2026 13:476,80383,828,84453,440,0003,024,0002,269,184