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 23:57olliecrowolliecrowScore: 62,338Success
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 23:5762,26844,309,75521,036,0002,003,0002,273,280
2Apr 15, 2026 23:5762,33851,028,63122,063,0001,002,0002,269,184
3Apr 15, 2026 23:5762,60850,109,58121,151,0002,014,0002,297,856