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 14:11Josu San MartinJosu San MartinScore: 70,281Success
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 14:1169,95751,893,90724,889,000995,0002,285,568
2Jan 12, 2026 14:1169,96255,738,04424,891,000995,0002,359,296
3Jan 12, 2026 14:1170,02451,499,20623,916,0001,993,0002,371,584
4Jan 12, 2026 14:1170,07054,065,21024,929,000997,0002,363,392
5Jan 12, 2026 14:1170,28152,185,68925,004,0001,000,0002,359,296
6Jan 12, 2026 14:1170,35954,241,90525,032,0001,001,0002,289,664
7Jan 12, 2026 14:1170,38151,734,75725,040,0001,001,0002,289,664
8Jan 12, 2026 14:1170,48454,759,23625,076,0001,003,0002,289,664
9Jan 12, 2026 14:1170,51151,044,68625,086,0001,003,0002,469,888