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:41Josu San MartinJosu San MartinScore: 72,543Success
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:3671,83847,686,91124,536,0002,044,0002,523,136
2Jan 12, 2026 04:4772,00551,266,52324,593,0002,049,0002,523,136
3Jan 12, 2026 04:3672,10357,879,88325,652,0001,026,0002,383,872
4Jan 12, 2026 04:3672,15453,774,65525,671,0001,026,0002,523,136
5Jan 12, 2026 04:5172,45453,244,67624,823,0001,985,0002,527,232
6Jan 12, 2026 04:4772,52256,156,80224,846,0001,987,0002,527,232
7Jan 12, 2026 04:5172,54352,523,42924,853,0001,988,0002,383,872
8Jan 12, 2026 04:5172,56558,814,36723,866,0002,983,0002,359,296
9Jan 12, 2026 04:4775,96250,758,29326,099,0002,007,0002,383,872
10Jan 12, 2026 04:4186,60059,339,92029,038,0003,004,0002,383,872
11Jan 12, 2026 04:4188,70356,313,99229,837,0002,983,0002,527,232
12Jan 12, 2026 04:4188,99764,180,29829,936,0002,993,0002,338,816