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 22:03Josu San MartinJosu San MartinScore: 18,167Success
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 22:0317,887157,951,180147,454,0001,012,0002,113,536
2Jul 3, 2026 22:0317,928158,293,901147,791,0001,012,0002,113,536
3Jul 3, 2026 22:0318,143160,161,533149,577,0001,011,0002,113,536
4Jul 3, 2026 22:0318,166160,279,144149,771,0001,010,0002,113,536
5Jul 3, 2026 22:0318,167160,817,659149,776,0001,011,0002,113,536
6Jul 3, 2026 22:0318,195160,514,452150,009,0001,013,0002,113,536
7Jul 3, 2026 22:0318,200160,585,513150,054,0001,010,0002,113,536
8Jul 3, 2026 22:0318,205161,115,929149,024,0002,079,0002,113,536
9Jul 3, 2026 22:0343,160368,294,269356,220,0002,010,0002,113,536