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 04:20Steve BronderSteve BronderScore: 71,295Success
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 04:2071,22746,594,72725,341,0001,013,0002,433,024
2Apr 21, 2025 04:2071,29548,164,91426,379,00002,519,040
3Apr 21, 2025 04:2071,51648,711,59425,444,0001,017,0002,428,928