TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listAug 4, 2024 13:50Andrey LikhachevAndrey LikhachevScore: 105,603Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2024 13:50104,24365,941,02737,555,0001,015,0002,367,488
2Aug 4, 2024 13:50104,96571,706,90736,846,0001,991,0002,367,488
3Aug 4, 2024 13:50105,02269,116,08737,862,000996,0002,289,664
4Aug 4, 2024 13:50105,35965,160,25536,984,0001,999,0002,363,392
5Aug 4, 2024 13:50105,36569,236,15736,986,0001,999,0002,289,664
6Aug 4, 2024 13:50105,43567,291,24137,011,0002,000,0002,375,680
7Aug 4, 2024 13:50105,60364,122,57737,070,0002,003,0002,285,568
8Aug 4, 2024 13:50105,72764,407,94438,116,0001,003,0002,379,776
9Aug 4, 2024 13:50105,95462,354,99737,193,0002,010,0002,375,680
10Aug 4, 2024 13:50106,095101,934,83139,255,05902,256,896
11Aug 4, 2024 13:50106,74990,728,92039,497,16502,207,744
12Aug 4, 2024 13:50107,41598,620,32839,743,39702,256,896