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 18, 2024 23:41zielajzielajScore: 3,718Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 18, 2024 23:413,54853,747,18528,434,0001,015,0002,367,488
2Nov 18, 2024 23:413,55954,604,50129,541,00002,527,232
3Nov 18, 2024 23:413,56861,753,30628,591,0001,021,0002,371,584
4Nov 18, 2024 23:413,71855,442,45229,866,000995,0002,375,680
5Nov 18, 2024 23:413,73356,208,86629,981,000999,0002,387,968
6Nov 18, 2024 23:413,76552,283,52529,236,0002,016,0002,269,184