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 listJan 19, 2025 09:07Ian MckibbenIan MckibbenScore: 71,105Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 19, 2025 09:0770,57048,914,41125,107,0001,004,0002,531,328
2Jan 19, 2025 09:0770,74953,110,31424,164,0002,013,0002,531,328
3Jan 19, 2025 09:0770,79748,835,81724,180,0002,015,0002,428,928
4Jan 19, 2025 09:0770,99553,414,56824,248,0002,020,0002,269,184
5Jan 19, 2025 09:0771,10543,819,01726,309,00002,433,024
6Jan 19, 2025 09:0771,11445,314,20326,312,00002,531,328
7Jan 19, 2025 09:0771,41449,339,46125,407,0001,016,0002,531,328
8Jan 19, 2025 09:0771,50545,760,74626,457,00002,428,928
9Jan 19, 2025 09:0771,55451,059,00726,475,00002,424,832