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 00:47olliecrowolliecrowScore: 70,165Success
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 00:4769,86854,588,73324,857,000994,0002,277,376
2Mar 4, 2026 00:4769,88152,223,22824,862,000994,0002,277,376
3Mar 4, 2026 00:4769,91455,077,87024,874,000994,0002,277,376
4Mar 4, 2026 00:4770,07854,767,54423,935,0001,994,0002,400,256
5Mar 4, 2026 00:4770,16550,320,25523,964,0001,997,0002,396,160
6Mar 4, 2026 00:4770,26251,403,37423,998,0001,999,0002,277,376
7Mar 4, 2026 00:4770,27350,139,03825,001,0001,000,0002,387,968
8Mar 4, 2026 00:4770,37052,877,02925,036,0001,001,0002,404,352
9Mar 4, 2026 00:4770,49253,835,71725,079,0001,003,0002,400,256