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:26Josu San MartinJosu San MartinScore: 81,965Success
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:2681,85452,560,57229,277,0001,009,0002,363,392
2Jan 12, 2026 04:2681,96551,791,19729,317,0001,010,0002,355,200
3Jan 12, 2026 04:2682,69554,573,08629,578,0001,019,0002,289,664