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 3, 2026 23:34olliecrowolliecrowScore: 70,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 23:3469,87348,504,39823,865,0001,988,0002,396,160
2Mar 3, 2026 23:3469,99750,623,48423,907,0001,992,0002,404,352
3Mar 3, 2026 23:3470,09560,846,70924,938,000997,0002,400,256
4Mar 3, 2026 23:3470,15956,232,22724,961,000998,0002,277,376
5Mar 3, 2026 23:3470,16852,334,17124,964,000998,0002,396,160
6Mar 3, 2026 23:3470,22458,668,45924,984,000999,0002,277,376
7Mar 3, 2026 23:3470,23854,310,26023,989,0001,999,0002,404,352
8Mar 3, 2026 23:3470,30854,067,38125,014,0001,000,0002,277,376
9Mar 3, 2026 23:3470,34151,613,83524,024,0002,002,0002,396,160