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 26, 2026 09:48Charles CabergsCharles CabergsScore: 70,881Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 09:4970,64542,426,50024,129,0002,010,0002,355,200
2Apr 26, 2026 09:4970,80545,651,28624,183,0002,015,0002,347,008
3Apr 26, 2026 09:4970,82743,934,60824,191,0002,015,0002,355,200
4Apr 26, 2026 09:4970,82746,908,97825,199,0001,007,0002,359,296
5Apr 26, 2026 09:4970,88141,088,09024,209,0002,017,0002,355,200
6Apr 26, 2026 09:4970,92944,740,25725,235,0001,009,0002,355,200
7Apr 26, 2026 09:4970,96742,162,30125,249,0001,009,0002,347,008
8Apr 26, 2026 09:4971,00042,642,40825,260,0001,010,0002,367,488
9Apr 26, 2026 09:4971,03740,846,12824,263,0002,021,0002,314,240