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 16, 2026 05:50olliecrowolliecrowScore: 60,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 05:5060,56846,370,83721,392,0001,018,0002,293,760
2Apr 16, 2026 05:5060,77045,130,92521,463,0001,022,0002,293,760
3Apr 16, 2026 05:5060,99548,784,28821,543,0001,025,0002,293,760