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 21, 2025 17:04Steve BronderSteve BronderScore: 74,262Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2025 17:0474,13053,118,71226,413,0001,015,0002,531,328
2Apr 21, 2025 17:0474,26249,816,68427,477,00002,531,328
3Apr 21, 2025 17:0474,43853,037,14226,522,0001,020,0002,265,088