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 listAug 14, 2026 23:07Tomislav TunkovicTomislav TunkovicScore: 57,410Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 23:0857,27829,562,65720,185,0001,008,0002,113,536
2Aug 14, 2026 23:0857,28629,581,60720,166,0001,030,0002,113,536
3Aug 14, 2026 23:0857,31629,580,98120,173,0001,034,0002,113,536
4Aug 14, 2026 23:0857,35929,631,23620,193,0001,030,0002,113,536
5Aug 14, 2026 23:0857,41029,597,62620,212,0001,030,0002,113,536
6Aug 14, 2026 23:0857,42929,658,36620,231,0001,018,0002,113,536
7Aug 14, 2026 23:0857,51029,671,81220,244,0001,035,0002,113,536
8Aug 14, 2026 23:0857,54329,666,67120,244,0001,047,0002,113,536
9Aug 14, 2026 23:0857,56729,696,72520,296,0001,004,0002,113,536