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 28, 2026 19:33Charles CabergsCharles CabergsScore: 72,689Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 19:3472,55941,253,87824,859,0001,988,0002,359,296
2Apr 28, 2026 19:3472,59444,235,93722,881,0003,979,0002,355,200
3Apr 28, 2026 19:3472,60045,594,05724,873,0001,989,0002,347,008
4Apr 28, 2026 19:3472,65643,916,90023,896,0002,987,0002,351,104
5Apr 28, 2026 19:3472,68945,663,98423,907,0002,988,0002,355,200
6Apr 28, 2026 19:3472,72445,998,05923,919,0002,989,0002,342,912
7Apr 28, 2026 19:3472,73541,170,12324,919,0001,993,0002,355,200
8Apr 28, 2026 19:3472,95444,676,56224,994,0001,999,0002,347,008
9Apr 28, 2026 19:3472,98645,458,07523,005,0004,000,0002,310,144