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:08Elnur RakhmatullinElnur RakhmatullinScore: 15,613Success
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:0815,453137,801,800127,088,0001,172,0002,113,536
2Jul 9, 2026 23:0815,461137,776,877127,175,0001,155,0002,113,536
3Jul 9, 2026 23:0815,585138,888,899128,202,0001,154,0002,113,536
4Jul 9, 2026 23:0815,595138,965,198128,278,0001,166,0002,113,536
5Jul 9, 2026 23:0815,613139,236,439128,408,0001,184,0002,113,536
6Jul 9, 2026 23:0815,619139,162,796128,479,0001,163,0002,113,536
7Jul 9, 2026 23:0815,636139,325,644128,617,0001,166,0002,113,536
8Jul 9, 2026 23:0815,740140,143,113129,471,0001,178,0002,113,536
9Jul 9, 2026 23:0815,760141,646,524129,805,0001,006,0002,113,536