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 17:32Josu San MartinJosu San MartinScore: 21,975Success
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 17:3221,927191,338,004176,749,0005,253,0002,113,536
2Jul 3, 2026 17:3221,943191,512,092176,823,0005,306,0002,113,536
3Jul 3, 2026 17:3221,948191,553,324177,017,0005,152,0002,113,536
4Jul 3, 2026 17:3221,966191,712,812176,887,0005,435,0002,113,536
5Jul 3, 2026 17:3221,975191,839,135177,224,0005,176,0002,113,536
6Jul 3, 2026 17:3221,989191,872,809177,185,0005,331,0002,113,536
7Jul 3, 2026 17:3222,031192,221,799177,564,0005,295,0002,113,536
8Jul 3, 2026 17:3222,141193,127,838178,527,0005,249,0002,113,536
9Jul 3, 2026 17:3222,377195,103,896180,363,0005,372,0002,113,536