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:05Steve BronderSteve BronderScore: 71,719Success
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:0571,59550,975,55525,472,0001,018,0002,428,928
2Apr 21, 2025 05:0571,71953,175,36624,571,0001,965,0002,527,232
3Apr 21, 2025 05:0571,81648,521,64224,528,0002,044,0002,527,232