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 20, 2024 01:07zielajzielajScore: 3,728Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2024 01:073,51057,806,53227,125,0002,009,0002,269,184
2Nov 20, 2024 01:073,51856,772,14627,186,0002,013,0002,523,136
3Nov 20, 2024 01:073,53956,329,39829,377,00002,383,872
4Nov 20, 2024 01:073,72858,644,49528,943,0001,996,0002,277,376
5Nov 20, 2024 01:073,86754,835,75530,093,0002,006,0002,260,992
6Nov 20, 2024 01:074,04258,463,25132,532,0001,016,0002,396,160