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 listJan 12, 2026 04:52Josu San MartinJosu San MartinScore: 70,611Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 04:5270,42752,893,71725,056,0001,002,0002,289,664
2Jan 12, 2026 04:5270,47351,774,20924,070,0002,005,0002,363,392
3Jan 12, 2026 04:5270,51951,698,99325,089,0001,003,0002,473,984
4Jan 12, 2026 04:5270,57846,001,93525,110,0001,004,0002,473,984
5Jan 12, 2026 04:5270,61156,083,17824,117,0002,009,0002,363,392
6Jan 12, 2026 04:5270,61152,923,66524,117,0002,009,0002,367,488
7Jan 12, 2026 04:5270,63045,468,02525,128,0001,005,0002,355,200
8Jan 12, 2026 04:5270,70849,028,30724,150,0002,012,0002,371,584
9Jan 12, 2026 04:5270,81653,555,51925,195,0001,007,0002,359,296