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 13, 2026 22:40olliecrowolliecrowScore: 60,276Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 22:4060,21648,463,56320,255,0002,025,0002,404,352
2Mar 13, 2026 22:4060,27645,704,58120,275,0002,027,0002,273,280
3Mar 13, 2026 22:4060,65142,825,13522,441,00002,273,280