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 listApr 22, 2026 05:05wnwnScore: 3,657Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 05:063,47847,369,55726,880,0001,991,0002,486,272
2Apr 22, 2026 05:063,52942,884,79928,288,0001,010,0002,494,464
3Apr 22, 2026 05:063,55344,568,48828,475,0001,016,0002,478,080
4Apr 22, 2026 05:063,55544,683,97228,496,0001,017,0002,555,904
5Apr 22, 2026 05:063,65745,465,74629,343,0001,011,0002,498,560
6Apr 22, 2026 05:063,67347,602,99529,476,0001,016,0002,482,176
7Apr 22, 2026 05:063,70049,499,59328,732,0001,981,0002,490,368
8Apr 22, 2026 05:063,89064,405,31931,285,0001,009,0002,314,240
9Apr 22, 2026 05:063,96978,641,39931,952,000998,0002,314,240