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 listSep 16, 2023 17:00mmalczakmmalczakScore: 95,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2023 17:0094,316102,005,74834,896,96202,265,088
2Sep 16, 2023 17:0094,35395,423,05534,910,67302,277,376
3Sep 16, 2023 17:0094,64959,231,02333,019,0002,001,0002,289,664
4Sep 16, 2023 17:0094,90555,858,99735,115,00002,527,232
5Sep 16, 2023 17:0095,487104,495,01735,330,17602,277,376
6Sep 16, 2023 17:0095,81663,609,57234,440,0001,012,0002,289,664
7Sep 16, 2023 17:0095,89255,790,60933,453,0002,027,0002,273,280
8Sep 16, 2023 17:0095,97657,023,82934,497,0001,014,0002,289,664
9Sep 16, 2023 17:0096,49562,257,52434,683,0001,020,0002,527,232
10Sep 16, 2023 17:0097,07365,990,64333,922,0001,995,0002,289,664
11Sep 16, 2023 17:0097,35162,424,94434,019,0002,001,0002,289,664
12Sep 16, 2023 17:0097,74161,133,59034,155,0002,009,0002,531,328