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 8, 2024 17:45Alexey TarasovAlexey TarasovScore: 70,338Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2024 17:4570,316610,271,740582,622,000999,0002,293,760
2Nov 8, 2024 17:4570,329614,511,283581,729,0001,999,0002,293,760
3Nov 8, 2024 17:4570,333607,210,049582,766,000999,0002,293,760
4Nov 8, 2024 17:4570,333615,770,999582,767,000999,0002,289,664
5Nov 8, 2024 17:4570,338610,855,635582,804,000999,0002,285,568
6Nov 8, 2024 17:4570,342607,307,989582,840,000999,0002,293,760
7Nov 8, 2024 17:4570,351612,664,426581,913,0001,999,0002,293,760
8Nov 8, 2024 17:4570,365611,711,511582,028,0002,000,0002,293,760
9Nov 8, 2024 17:4570,452609,068,761583,755,000999,0002,293,760