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 listJul 3, 2026 19:24Josu San MartinJosu San MartinScore: 6,886Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 19:256,83166,080,26151,375,0005,329,0002,113,536
2Jul 3, 2026 19:256,83466,137,22551,455,0005,270,0002,113,536
3Jul 3, 2026 19:256,86966,389,23351,787,0005,232,0002,113,536
4Jul 3, 2026 19:256,87666,449,86151,743,0005,334,0002,113,536
5Jul 3, 2026 19:256,88666,625,01651,891,0005,264,0002,113,536
6Jul 3, 2026 19:256,90067,916,12551,849,0005,423,0002,113,536
7Jul 3, 2026 19:256,91566,652,82452,031,0005,368,0002,113,536
8Jul 3, 2026 19:256,93567,032,53552,046,0005,520,0002,113,536
9Jul 3, 2026 19:256,97767,687,92352,412,0005,500,0002,113,536