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 15, 2026 12:42olliecrowolliecrowScore: 69,127Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2026 12:4268,29251,837,14422,236,0003,032,0002,334,720
2Apr 15, 2026 12:4269,12744,786,35424,554,0001,023,0002,310,144
3Apr 15, 2026 12:4271,51654,192,56524,426,0002,035,0002,314,240