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 4, 2026 01:19Josu San MartinJosu San MartinScore: 5,252Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 01:205,15052,132,51739,401,0003,348,0002,113,536
2Jul 4, 2026 01:205,16652,292,96139,525,0003,354,0002,113,536
3Jul 4, 2026 01:205,17852,654,15839,643,0003,338,0002,113,536
4Jul 4, 2026 01:205,23452,935,80439,955,0003,491,0002,113,536
5Jul 4, 2026 01:205,25253,020,50740,227,0003,369,0002,113,536
6Jul 4, 2026 01:205,29153,241,21340,572,0003,350,0002,113,536
7Jul 4, 2026 01:205,32654,880,76440,671,0003,543,0002,113,536
8Jul 4, 2026 01:205,43054,507,25741,533,0003,539,0002,113,536
9Jul 4, 2026 01:205,50055,083,63942,168,0003,483,0002,113,536