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 21, 2026 16:36izotoffizotoffScore: 115,778Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 16:36115,10072,831,45842,587,00002,383,872
2Mar 21, 2026 16:36115,22269,427,66841,617,0001,015,0002,330,624
3Mar 21, 2026 16:36115,72467,499,71940,827,0001,991,0002,334,720
4Mar 21, 2026 16:36115,77072,695,85341,839,000996,0002,383,872
5Mar 21, 2026 16:36115,77871,824,61540,846,0001,992,0002,383,872
6Mar 21, 2026 16:36116,51972,495,08541,107,0002,005,0002,326,528
7Mar 21, 2026 16:36116,66565,042,87941,159,0002,007,0002,392,064
8Mar 21, 2026 16:36119,16884,148,78741,086,0003,006,0002,330,624
9Mar 21, 2026 16:36125,88472,712,15745,565,0001,012,0002,330,624