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 22, 2024 21:21MatthiasMatthiasScore: 62,603Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 22, 2024 21:2162,576548,397,394518,379,0001,000,0002,277,376
2Nov 22, 2024 21:2162,579545,268,094518,402,0001,000,0002,293,760
3Nov 22, 2024 21:2162,593541,615,252517,520,0001,998,0002,281,472
4Nov 22, 2024 21:2162,600544,980,806517,585,0001,998,0002,281,472
5Nov 22, 2024 21:2162,603545,388,864519,603,00002,293,760
6Nov 22, 2024 21:2162,603543,708,189518,605,000999,0002,289,664
7Nov 22, 2024 21:2162,620550,403,849517,745,0001,999,0002,514,944
8Nov 22, 2024 21:2162,722547,756,073518,594,0001,998,0002,281,472
9Nov 22, 2024 21:2162,735543,584,144518,700,0001,998,0002,265,088