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 14, 2026 13:44boop34boop34Score: 20,154Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 13:4420,131176,839,121166,037,0001,054,0002,113,536
2Jul 14, 2026 13:4420,132176,727,772166,059,0001,040,0002,113,536
3Jul 14, 2026 13:4420,137176,777,459166,098,0001,042,0002,113,536
4Jul 14, 2026 13:4420,139176,986,086166,088,0001,069,0002,113,536
5Jul 14, 2026 13:4420,154177,615,408166,211,0001,069,0002,113,536
6Jul 14, 2026 13:4420,156177,058,144166,242,0001,054,0002,113,536
7Jul 14, 2026 13:4420,158177,674,196166,217,0001,095,0002,113,536
8Jul 14, 2026 13:4420,268178,365,689167,121,0001,105,0002,113,536
9Jul 14, 2026 13:4420,635181,029,747170,164,0001,108,0002,113,536