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:41zielajzielajScore: 3,695Success
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:413,53451,575,06728,319,0001,011,0002,383,872
2Nov 20, 2024 01:413,53450,355,60128,321,0001,011,0002,514,944
3Nov 20, 2024 01:413,59954,352,59528,876,000995,0002,387,968
4Nov 20, 2024 01:413,69553,708,62929,645,0001,022,0002,277,376
5Nov 20, 2024 01:413,76649,907,33729,239,0002,016,0002,396,160
6Nov 20, 2024 01:413,77157,377,85529,284,0002,019,0002,396,160