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 listJun 25, 2026 18:44IlyaIlyaScore: 73,932Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 18:4573,57836,476,39126,111,0001,113,0002,113,536
2Jun 25, 2026 18:4573,78636,975,63726,093,0001,208,0002,113,536
3Jun 25, 2026 18:4573,81037,090,85726,086,0001,224,0002,113,536
4Jun 25, 2026 18:4573,86437,048,08726,127,0001,203,0002,113,536
5Jun 25, 2026 18:4573,93237,022,82826,149,0001,206,0002,113,536
6Jun 25, 2026 18:4574,00837,081,04126,170,0001,213,0002,113,536
7Jun 25, 2026 18:4574,28336,970,53326,272,0001,213,0002,113,536
8Jun 25, 2026 18:4574,28937,211,69326,280,0001,207,0002,113,536
9Jun 25, 2026 18:4574,29137,256,08426,264,0001,224,0002,113,536