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 03:25Daniel MastalerzDaniel MastalerzScore: 7,087Success
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 03:256,79982,279,04250,387,0006,046,0002,281,472
2Feb 18, 2026 03:256,80279,152,81150,406,0006,048,0002,355,200
3Feb 18, 2026 03:256,82786,740,32247,721,0008,947,0002,326,528
4Feb 18, 2026 03:257,08781,747,62449,853,0008,973,0002,363,392
5Feb 18, 2026 03:257,12187,751,42849,085,00010,017,0002,392,064
6Feb 18, 2026 03:257,12483,777,74755,124,0004,009,0002,428,928