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 listSep 26, 2025 17:18sheryllynn24sheryllynn24Score: 6,606Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2025 17:186,60375,831,10653,806,000996,0002,269,184
2Sep 26, 2025 17:186,60381,934,84253,809,000996,0002,260,992
3Sep 26, 2025 17:186,60384,592,77253,811,000996,0002,285,568
4Sep 26, 2025 17:186,60481,255,32153,814,000996,0002,523,136
5Sep 26, 2025 17:186,60486,814,27152,823,0001,993,0002,285,568
6Sep 26, 2025 17:186,60579,303,59053,829,000996,0002,285,568
7Sep 26, 2025 17:186,60682,509,67553,835,000996,0002,277,376
8Sep 26, 2025 17:186,60681,737,17853,835,000996,0002,265,088
9Sep 26, 2025 17:186,60979,213,05153,857,000997,0002,519,040
10Sep 26, 2025 17:186,72487,152,84154,811,000996,0002,285,568
11Sep 26, 2025 17:186,73479,407,46053,894,0001,996,0002,285,568
12Sep 26, 2025 17:186,74584,906,82753,983,0001,999,0002,514,944