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 17, 2024 23:45zielajzielajScore: 3,853Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 17, 2024 23:453,80152,116,61130,533,0001,017,0002,514,944
2Nov 17, 2024 23:453,83759,720,25330,851,000995,0002,523,136
3Nov 17, 2024 23:453,83862,086,12930,860,000995,0002,527,232
4Nov 17, 2024 23:453,85360,997,03729,980,0001,998,0002,383,872
5Nov 17, 2024 23:453,86360,440,15930,058,0002,003,0002,383,872
6Nov 17, 2024 23:453,91955,736,42331,510,0001,016,0002,387,968