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 02:06Ian MckibbenIan MckibbenScore: 73,957Success
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 02:0673,91952,218,30527,350,00002,527,232
2Jan 22, 2025 02:0673,95750,340,42926,351,0001,013,0002,265,088
3Jan 22, 2025 02:0674,21450,088,67727,459,00002,428,928