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 22:35IlyaIlyaScore: 63,451Success
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 22:3663,16432,588,63722,180,0001,191,0002,113,536
2Jun 25, 2026 22:3663,32733,245,82822,232,0001,199,0002,113,536
3Jun 25, 2026 22:3663,36432,730,61722,266,0001,179,0002,113,536
4Jun 25, 2026 22:3663,40233,184,61322,269,0001,190,0002,113,536
5Jun 25, 2026 22:3663,45133,214,39322,269,0001,208,0002,113,536
6Jun 25, 2026 22:3663,50233,228,03622,266,0001,230,0002,113,536
7Jun 25, 2026 22:3663,64532,874,29022,350,0001,199,0002,113,536
8Jun 25, 2026 22:3663,74033,361,35122,365,0001,219,0002,113,536
9Jun 25, 2026 22:3663,86433,349,56722,386,0001,244,0002,113,536