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 18:28Josu San MartinJosu San MartinScore: 9,581Success
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 18:299,52588,382,54473,895,0005,168,0002,113,536
2Jul 3, 2026 18:299,53088,460,83573,898,0005,201,0002,113,536
3Jul 3, 2026 18:299,56688,783,33474,070,0005,335,0002,113,536
4Jul 3, 2026 18:299,56888,785,07674,257,0005,165,0002,113,536
5Jul 3, 2026 18:299,58188,880,04274,243,0005,283,0002,113,536
6Jul 3, 2026 18:299,60589,340,36174,492,0005,231,0002,113,536
7Jul 3, 2026 18:299,61089,168,48374,566,0005,201,0002,113,536
8Jul 3, 2026 18:299,63189,284,73974,870,0005,075,0002,113,536
9Jul 3, 2026 18:299,64089,362,77174,849,0005,164,0002,113,536