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 listMay 26, 2025 06:46E SequeiraE SequeiraScore: 74,611Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2025 06:4673,95949,834,65525,338,0002,027,0002,260,992
2May 26, 2025 06:4674,61157,712,85726,584,0001,022,0002,355,200
3May 26, 2025 06:4674,82444,925,15327,685,00002,285,568