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 listMar 3, 2026 22:32olliecrowolliecrowScore: 70,641Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 22:3270,51949,254,14625,089,0001,003,0002,387,968
2Mar 3, 2026 22:3270,64155,967,42724,127,0002,010,0002,392,064
3Mar 3, 2026 22:3270,95947,684,96124,236,0002,019,0002,277,376