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 29, 2026 13:51IlyaIlyaScore: 62,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 13:5562,28333,367,81821,935,0001,110,0002,113,536
2Jun 29, 2026 13:5562,39432,608,01621,983,0001,103,0002,113,536
3Jun 29, 2026 13:5562,53733,050,87321,937,0001,202,0002,113,536
4Jun 29, 2026 13:5562,55932,624,60922,029,0001,118,0002,113,536
5Jun 29, 2026 13:5562,60832,730,34022,035,0001,130,0002,113,536
6Jun 29, 2026 13:5562,62133,126,00821,972,0001,198,0002,113,536
7Jun 29, 2026 13:5562,65132,672,22122,030,0001,151,0002,113,536
8Jun 29, 2026 13:5562,84333,207,51322,187,0001,065,0002,113,536
9Jun 29, 2026 13:5563,51633,440,73622,293,0001,208,0002,113,536