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 listMay 7, 2024 19:13Joad NacerJoad NacerScore: 69,514Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2024 19:1369,50886,550,40225,717,97502,260,992
2May 7, 2024 19:1369,51492,922,01725,720,07102,265,088
3May 7, 2024 19:1370,01598,029,43225,905,44102,265,088