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 04:05olliecrowolliecrowScore: 69,927Success
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 04:0569,84152,451,23424,848,000993,0002,277,376
2Mar 4, 2026 04:0569,84950,728,89925,844,00002,277,376
3Mar 4, 2026 04:0569,85156,915,35425,845,00002,277,376
4Mar 4, 2026 04:0569,88651,649,03825,858,00002,400,256
5Mar 4, 2026 04:0569,92753,605,55824,878,000995,0002,396,160
6Mar 4, 2026 04:0569,93852,139,25924,882,000995,0002,277,376
7Mar 4, 2026 04:0570,04155,386,93924,919,000996,0002,277,376
8Mar 4, 2026 04:0570,18954,184,05223,973,0001,997,0002,396,160
9Mar 4, 2026 04:0570,20352,569,39124,976,000999,0002,277,376