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 listMar 21, 2026 07:54olliecrowolliecrowScore: 7,401Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 07:557,33085,185,23858,843,0001,994,0002,506,752
2Mar 21, 2026 07:487,33285,301,74057,861,0002,992,0002,510,848
3Mar 21, 2026 07:487,33282,902,45456,862,0003,990,0002,478,080
4Mar 21, 2026 07:487,34189,884,80957,932,0002,996,0002,494,464
5Mar 21, 2026 07:557,34587,844,88157,964,0002,998,0002,412,544
6Mar 21, 2026 07:557,39388,653,14958,345,0003,017,0002,519,040
7Mar 21, 2026 07:547,40197,706,39459,418,0002,014,0002,408,448
8Mar 21, 2026 07:557,40589,718,92460,457,0001,007,0002,502,656
9Mar 21, 2026 07:547,44689,756,55359,812,0001,993,0002,338,816
10Mar 21, 2026 07:557,51991,909,87858,385,0004,026,0002,383,872
11Mar 21, 2026 07:557,53189,949,75960,492,0002,016,0002,441,216
12Mar 21, 2026 07:548,41793,351,57366,864,0002,993,0002,490,368