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 13, 2026 02:10Josu San MartinJosu San MartinScore: 68,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 02:1068,57656,982,02925,373,00002,355,200
2Jan 13, 2026 02:1068,65151,067,06224,385,0001,016,0002,355,200
3Jan 13, 2026 02:1068,68149,365,09124,396,0001,016,0002,359,296
4Jan 13, 2026 02:1068,69246,090,75125,416,00002,363,392
5Jan 13, 2026 02:1068,70848,567,42424,406,0001,016,0002,355,200
6Jan 13, 2026 02:1068,76546,653,28525,443,00002,289,664
7Jan 13, 2026 02:1068,90846,389,42925,496,00002,347,008
8Jan 13, 2026 02:1069,10851,685,39324,548,0001,022,0002,289,664
9Jan 13, 2026 02:1069,11151,775,35925,571,00002,289,664