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 12, 2026 03:31olliecrowolliecrowScore: 60,997Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 03:3160,73047,983,03221,449,0001,021,0002,273,280
2Mar 12, 2026 03:3160,99746,292,70221,544,0001,025,0002,273,280
3Mar 12, 2026 03:3161,15148,333,22021,598,0001,028,0002,273,280