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 14, 2024 02:51zielajzielajScore: 5,221Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 14, 2024 02:515,15970,593,06540,825,0001,991,0002,363,392
2Nov 14, 2024 02:515,16065,896,03741,836,000996,0002,514,944
3Nov 14, 2024 02:515,16862,578,07641,894,000997,0002,367,488
4Nov 14, 2024 02:515,17366,085,26540,941,0001,997,0002,367,488
5Nov 14, 2024 02:515,19069,198,93641,078,0002,003,0002,519,040
6Nov 14, 2024 02:515,19367,228,77242,101,0001,002,0002,514,944
7Nov 14, 2024 02:515,22179,753,41343,331,00002,514,944
8Nov 14, 2024 02:515,23566,749,42943,447,00002,514,944
9Nov 14, 2024 02:515,44072,144,69244,153,0001,003,0002,465,792
10Nov 14, 2024 02:516,82785,437,74955,654,0001,011,0002,387,968
11Nov 14, 2024 02:516,89579,306,26655,221,0002,008,0002,379,776
12Nov 14, 2024 02:516,92089,231,32157,439,00002,527,232