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 listMar 13, 2026 15:34olliecrowolliecrowScore: 60,346Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 15:3460,05447,674,73821,210,0001,010,0002,273,280
2Mar 13, 2026 15:3460,08941,195,14820,212,0002,021,0002,400,256
3Mar 13, 2026 15:3460,22746,337,08921,272,0001,012,0002,387,968
4Mar 13, 2026 15:3460,24643,941,95120,265,0002,026,0002,273,280
5Mar 13, 2026 15:3460,34647,937,24420,299,0002,029,0002,396,160
6Mar 13, 2026 15:3460,36244,334,73022,334,00002,273,280
7Mar 13, 2026 15:3460,44343,677,00821,348,0001,016,0002,273,280
8Mar 13, 2026 15:3460,68445,000,23321,433,0001,020,0002,273,280
9Mar 13, 2026 15:3460,80846,607,41221,477,0001,022,0002,269,184