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 listMar 16, 2025 14:41CemaCemaScore: 86,111Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2025 14:4184,64657,287,70430,309,0001,010,0002,527,232
2Mar 16, 2025 14:4186,11157,988,68129,870,0001,991,0002,289,664
3Mar 16, 2025 14:4186,16255,037,38729,888,0001,992,0002,265,088