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 05:17Steve BronderSteve BronderScore: 73,670Success
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 05:1773,61654,701,53726,230,0001,008,0002,531,328
2Apr 21, 2025 05:1773,67049,648,74424,230,0003,028,0002,437,120
3Apr 21, 2025 05:1773,71951,314,98426,266,0001,010,0002,428,928