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 18, 2026 01:45Yuriy LyfenkoYuriy LyfenkoScore: 5,776Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 01:455,69374,749,54844,233,0003,015,0002,285,568
2Mar 18, 2026 01:455,69671,306,87745,264,0002,011,0002,314,240
3Mar 18, 2026 01:465,70177,431,75646,314,0001,006,0002,285,568
4Mar 18, 2026 01:465,71369,701,67245,402,0002,017,0002,293,760
5Mar 18, 2026 01:455,72270,595,01346,485,0001,010,0002,285,568
6Mar 18, 2026 01:455,73973,655,45444,658,0002,977,0002,314,240
7Mar 18, 2026 01:455,77676,081,41245,946,0001,997,0002,285,568
8Mar 18, 2026 01:455,77977,614,63244,965,0002,997,0002,285,568
9Mar 18, 2026 01:455,79673,755,13447,104,0001,002,0002,301,952
10Mar 18, 2026 01:455,81674,671,28646,260,0002,011,0002,301,952
11Mar 18, 2026 01:465,82676,699,01246,342,0002,014,0002,285,568
12Mar 18, 2026 01:455,84073,084,73945,444,0003,029,0002,285,568