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 03:08Ian MckibbenIan MckibbenScore: 74,027Success
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 03:0873,90352,784,31425,319,0002,025,0002,531,328
2Jan 22, 2025 03:0874,02749,101,59826,376,0001,014,0002,531,328
3Jan 22, 2025 03:0874,46848,769,98926,533,0001,020,0002,445,312