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 listNov 15, 2024 10:32KrishanKrishanScore: 83,479Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 15, 2024 10:3283,451721,640,111691,645,000999,0002,293,760
2Nov 15, 2024 10:3283,459720,099,676690,711,0001,999,0002,465,792
3Nov 15, 2024 10:3283,464715,783,738690,749,0001,999,0002,359,296
4Nov 15, 2024 10:3283,476720,324,482691,850,000999,0002,293,760
5Nov 15, 2024 10:3283,479721,002,578690,875,0001,999,0002,293,760
6Nov 15, 2024 10:3283,480719,766,318691,882,000999,0002,285,568
7Nov 15, 2024 10:3283,489715,479,833692,958,00002,285,568
8Nov 15, 2024 10:3283,493719,438,802691,994,000999,0002,293,760
9Nov 15, 2024 10:3283,505717,436,128692,094,0001,000,0002,371,584