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 30, 2026 13:46IlyaIlyaScore: 62,978Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 13:4862,66732,643,70022,068,0001,119,0002,113,536
2Jun 30, 2026 13:4862,68632,688,29622,003,0001,191,0002,113,536
3Jun 30, 2026 13:4862,71032,699,63522,093,0001,110,0002,113,536
4Jun 30, 2026 13:4862,76732,683,57022,110,0001,114,0002,113,536
5Jun 30, 2026 13:4862,97832,845,20722,128,0001,174,0002,113,536
6Jun 30, 2026 13:4863,03533,279,49122,111,0001,212,0002,113,536
7Jun 30, 2026 13:4863,16432,869,62422,156,0001,215,0002,113,536
8Jun 30, 2026 13:4863,33533,343,40822,216,0001,218,0002,113,536
9Jun 30, 2026 13:4872,47246,280,85825,638,0001,177,0002,113,536