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 22:43olliecrowolliecrowScore: 70,868Success
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 22:4370,49749,163,76725,081,0001,003,0002,396,160
2Mar 3, 2026 22:4270,63849,231,86524,126,0002,010,0002,404,352
3Mar 3, 2026 22:4270,65152,272,84825,136,0001,005,0002,277,376
4Mar 3, 2026 22:4270,65151,596,35425,136,0001,005,0002,400,256
5Mar 3, 2026 22:4270,65952,972,64424,133,0002,011,0002,277,376
6Mar 3, 2026 22:4370,81950,564,92924,188,0002,015,0002,277,376
7Mar 3, 2026 22:4270,86848,040,55424,204,0002,017,0002,514,944
8Mar 3, 2026 22:4370,90848,041,75825,227,0001,009,0002,404,352
9Mar 3, 2026 22:4370,95748,737,45824,235,0002,019,0002,392,064
10Mar 3, 2026 22:4271,25448,978,67225,350,0001,014,0002,396,160
11Mar 3, 2026 22:4371,42455,217,67326,427,00002,400,256
12Mar 3, 2026 22:4371,87859,479,92224,625,0001,970,0002,400,256