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 listApr 18, 2026 15:21Charles CabergsCharles CabergsScore: 84,132Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 15:2183,55456,583,16228,921,0001,994,0002,383,872
2Apr 18, 2026 15:2183,63556,579,37028,949,0001,996,0002,519,040
3Apr 18, 2026 15:2183,85956,822,10230,028,0001,000,0002,387,968
4Apr 18, 2026 15:2184,06862,007,34630,102,0001,003,0002,392,064
5Apr 18, 2026 15:2184,13256,803,04629,121,0002,008,0002,375,680
6Apr 18, 2026 15:2184,18457,138,33528,134,0003,014,0002,519,040
7Apr 18, 2026 15:2184,22761,137,02530,159,0001,005,0002,519,040
8Apr 18, 2026 15:2184,41457,316,14831,233,00002,387,968
9Apr 18, 2026 15:2184,52458,669,87129,257,0002,017,0002,519,040