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 9, 2026 23:09Elnur RakhmatullinElnur RakhmatullinScore: 15,612Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 23:1015,499138,096,028127,640,0001,002,0002,113,536
2Jul 9, 2026 23:1015,516138,383,008127,622,0001,166,0002,113,536
3Jul 9, 2026 23:1015,579138,831,758128,142,0001,170,0002,113,536
4Jul 9, 2026 23:1015,599139,041,984128,309,0001,164,0002,113,536
5Jul 9, 2026 23:1015,612139,058,601128,420,0001,164,0002,113,536
6Jul 9, 2026 23:1015,666139,619,680128,868,0001,166,0002,113,536
7Jul 9, 2026 23:1015,671139,501,973128,909,0001,166,0002,113,536
8Jul 9, 2026 23:1015,786140,550,542129,857,0001,170,0002,113,536
9Jul 9, 2026 23:1015,800140,704,146129,952,0001,191,0002,113,536