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 4, 2026 02:41olliecrowolliecrowScore: 70,035Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 01:3969,80852,259,48224,836,000993,0002,404,352
2Mar 4, 2026 01:3969,85950,286,83723,860,0001,988,0002,277,376
3Mar 4, 2026 01:3969,86550,396,28623,862,0001,988,0002,387,968
4Mar 4, 2026 01:3969,97055,223,86724,894,000995,0002,277,376
5Mar 4, 2026 02:4170,00852,194,82024,867,0001,036,0002,277,376
6Mar 4, 2026 01:3970,02251,757,89824,912,000996,0002,277,376
7Mar 4, 2026 01:3970,03550,607,35523,920,0001,993,0002,412,544
8Mar 4, 2026 02:4170,08453,354,49024,934,000997,0002,277,376
9Mar 4, 2026 01:3970,13052,668,35423,952,0001,996,0002,277,376
10Mar 4, 2026 02:4170,20857,775,02224,978,000999,0002,396,160
11Mar 4, 2026 01:3970,27350,380,74924,001,0002,000,0002,277,376
12Mar 4, 2026 01:3970,44151,846,08625,061,0001,002,0002,404,352