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 listMay 10, 2026 03:44Josu San MartinJosu San MartinScore: 4,402Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 03:454,38354,322,12235,278,0001,105,0002,555,904
2May 10, 2026 03:454,39254,497,53435,345,0001,109,0002,547,712
3May 10, 2026 03:454,39451,080,06135,375,0001,100,0002,543,616
4May 10, 2026 03:454,40051,887,06935,406,0001,114,0002,547,712
5May 10, 2026 03:454,40252,079,71635,432,0001,105,0002,547,712
6May 10, 2026 03:454,40253,457,61035,405,0001,136,0002,560,000
7May 10, 2026 03:454,42154,215,90135,556,0001,143,0002,555,904
8May 10, 2026 03:454,42954,077,36935,695,0001,068,0002,551,808
9May 10, 2026 03:454,44951,922,02535,909,0001,022,0002,551,808