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:05Ian MckibbenIan MckibbenScore: 71,057Success
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:0570,70046,172,37225,153,0001,006,0002,428,928
2Jan 19, 2025 09:0570,73047,664,87024,157,0002,013,0002,531,328
3Jan 19, 2025 09:0570,89552,892,07424,214,0002,017,0002,531,328
4Jan 19, 2025 09:0570,91448,342,19825,229,0001,009,0002,428,928
5Jan 19, 2025 09:0571,05749,362,44025,280,0001,011,0002,433,024
6Jan 19, 2025 09:0571,06251,880,82125,282,0001,011,0002,531,328
7Jan 19, 2025 09:0571,46248,654,95126,441,00002,437,120
8Jan 19, 2025 09:0571,47849,522,60326,447,00002,433,024
9Jan 19, 2025 09:0571,73553,254,09526,542,00002,428,928