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 07:46Ian MckibbenIan MckibbenScore: 76,900Success
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 07:4676,42249,697,82127,267,0001,009,0002,437,120
2Jan 19, 2025 07:4676,90049,990,88628,453,00002,428,928
3Jan 19, 2025 07:4677,45158,230,74527,634,0001,023,0002,531,328