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:09Josu San MartinJosu San MartinScore: 5,333Success
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:105,20152,467,68639,881,0003,288,0002,113,536
2Jul 4, 2026 01:105,29353,304,45240,598,0003,341,0002,113,536
3Jul 4, 2026 01:105,30853,510,58740,650,0003,412,0002,113,536
4Jul 4, 2026 01:105,31353,467,59940,556,0003,547,0002,113,536
5Jul 4, 2026 01:105,33353,657,50940,813,0003,459,0002,113,536
6Jul 4, 2026 01:105,34253,831,43440,903,0003,439,0002,113,536
7Jul 4, 2026 01:105,35155,236,99240,982,0003,434,0002,113,536
8Jul 4, 2026 01:105,39754,084,58041,346,0003,451,0002,113,536
9Jul 4, 2026 01:105,48855,127,98742,115,0003,438,0002,113,536