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:41Ian MckibbenIan MckibbenScore: 71,295Success
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:4171,03048,706,37625,271,0001,010,0002,531,328
2Jan 22, 2025 01:4171,29549,285,70426,379,00002,531,328
3Jan 22, 2025 01:4171,63850,731,99426,506,00002,269,184