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 listJun 15, 2025 11:22Steve BronderSteve BronderScore: 71,689Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2025 11:2271,31155,563,85125,371,0001,014,0002,428,928
2Jun 15, 2025 11:2271,68949,123,92626,525,00002,428,928
3Jun 15, 2025 11:2271,72454,426,89526,538,00002,424,832