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 listApr 19, 2026 07:03Charles CabergsCharles CabergsScore: 72,516Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 07:0372,04655,868,27125,632,0001,025,0002,519,040
2Apr 19, 2026 07:0372,06851,518,92625,640,0001,025,0002,510,848
3Apr 19, 2026 07:0372,14954,720,46225,669,0001,026,0002,519,040
4Apr 19, 2026 07:0372,22753,025,45125,697,0001,027,0002,379,776
5Apr 19, 2026 07:0372,51654,274,24925,838,000993,0002,519,040
6Apr 19, 2026 07:0372,58957,639,71824,869,0001,989,0002,371,584
7Apr 19, 2026 07:0372,59253,290,60924,870,0001,989,0002,498,560
8Apr 19, 2026 07:0372,60055,174,45025,868,000994,0002,519,040
9Apr 19, 2026 07:0372,60856,918,88524,875,0001,990,0002,383,872