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 9, 2026 09:32olliecrowolliecrowScore: 263,086Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2026 09:32262,876119,463,68594,256,0003,008,0002,306,048
2Apr 9, 2026 09:32263,086120,927,77694,332,0003,010,0002,306,048
3Apr 9, 2026 09:32265,165120,004,26996,109,0002,002,0002,342,912