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 10, 2026 09:05wnwnScore: 3,477Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 09:053,41336,387,38027,316,0001,017,0002,113,536
2Jul 10, 2026 09:053,44536,634,42927,568,0001,027,0002,113,536
3Jul 10, 2026 09:053,46336,670,56327,736,0001,007,0002,113,536
4Jul 10, 2026 09:053,46437,346,72727,749,0001,003,0002,113,536
5Jul 10, 2026 09:053,47736,957,70327,822,0001,040,0002,113,536
6Jul 10, 2026 09:053,50537,158,28028,071,0001,027,0002,113,536
7Jul 10, 2026 09:053,52137,585,65128,203,0001,026,0002,113,536
8Jul 10, 2026 09:053,52237,839,17628,236,0001,002,0002,113,536
9Jul 10, 2026 09:053,54237,980,97128,401,0001,004,0002,113,536