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:34zielajzielajScore: 3,726Success
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:343,52960,992,66028,279,0001,009,0002,478,080
2Nov 20, 2024 01:343,54051,788,75728,367,0001,013,0002,527,232
3Nov 20, 2024 01:343,54752,285,75828,421,0001,015,0002,523,136
4Nov 20, 2024 01:343,72655,534,29828,931,0001,995,0002,400,256
5Nov 20, 2024 01:343,72758,505,94728,935,0001,995,0002,404,352
6Nov 20, 2024 01:343,73453,557,26929,996,000999,0002,392,064