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 listJan 25, 2025 14:57bendnbendnScore: 127,629Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 25, 2025 14:57127,3691,090,545,9711,055,166,0001,998,0002,289,664
2Jan 25, 2025 14:57127,3911,085,537,8541,056,343,000999,0002,465,792
3Jan 25, 2025 14:58127,5701,079,197,2891,058,828,00002,285,568
4Jan 25, 2025 14:58127,6271,085,859,2901,057,303,0001,998,0002,285,568
5Jan 25, 2025 14:57127,6291,093,468,1551,058,320,000999,0002,293,760
6Jan 25, 2025 14:57127,6401,091,021,0021,057,416,0001,998,0002,371,584
7Jan 25, 2025 14:58127,6701,088,306,0451,057,659,0001,999,0002,465,792
8Jan 25, 2025 14:57127,8631,089,796,2031,059,268,0001,998,0002,293,760
9Jan 25, 2025 14:57128,9791,098,212,1811,069,530,000999,0002,289,664