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:46Alexey TarasovAlexey TarasovScore: 70,336Success
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:4670,292610,180,025582,421,0001,000,0002,293,760
2Nov 8, 2024 17:4670,325613,306,067581,700,0001,998,0002,359,296
3Nov 8, 2024 17:4670,329614,559,487582,735,000999,0002,289,664
4Nov 8, 2024 17:4670,331618,227,796581,749,0001,999,0002,367,488
5Nov 8, 2024 17:4670,336613,642,496581,788,0001,999,0002,289,664
6Nov 8, 2024 17:4670,349605,187,871581,899,0001,999,0002,293,760
7Nov 8, 2024 17:4670,389609,217,162584,232,00002,293,760
8Nov 8, 2024 17:4670,416609,303,732584,454,00002,293,760
9Nov 8, 2024 17:4670,434612,905,728582,603,0001,998,0002,293,760