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 22, 2025 01:45Ian MckibbenIan MckibbenScore: 83,014Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 01:4582,99258,068,28930,707,00002,531,328
2Jan 22, 2025 01:4583,01456,028,61730,715,00002,433,024
3Jan 22, 2025 01:4583,71154,894,66229,974,000999,0002,428,928