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:32Ian MckibbenIan MckibbenScore: 70,719Success
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:3270,54150,044,16424,093,0002,007,0002,269,184
2Jan 19, 2025 09:3270,71949,424,70225,160,0001,006,0002,433,024
3Jan 19, 2025 09:3271,39552,759,62526,416,00002,269,184