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:42Elnur RakhmatullinElnur RakhmatullinScore: 13,652Success
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:4213,632122,748,679110,818,0002,328,0002,113,536
2Jul 9, 2026 23:4213,644122,962,210110,859,0002,394,0002,113,536
3Jul 9, 2026 23:4213,646122,950,578110,828,0002,438,0002,113,536
4Jul 9, 2026 23:4213,651122,983,159110,852,0002,457,0002,113,536
5Jul 9, 2026 23:4213,652123,565,537111,302,0002,012,0002,113,536
6Jul 9, 2026 23:4213,653123,668,411111,315,0002,013,0002,113,536
7Jul 9, 2026 23:4213,657123,655,914111,349,0002,010,0002,113,536
8Jul 9, 2026 23:4213,668123,063,477111,431,0002,014,0002,113,536
9Jul 9, 2026 23:4213,670123,769,806111,444,0002,017,0002,113,536