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 listDec 30, 2025 00:34Josu San MartinJosu San MartinScore: 138,073Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2025 00:34137,75479,895,95648,971,0001,998,0002,285,568
2Dec 30, 2025 00:34137,83877,462,87750,000,0001,000,0002,363,392
3Dec 30, 2025 00:34137,92483,737,23750,032,0001,000,0002,347,008
4Dec 30, 2025 00:34137,94678,756,56149,039,0002,001,0002,367,488
5Dec 30, 2025 00:34138,07379,166,47350,086,0001,001,0002,355,200
6Dec 30, 2025 00:34138,26872,132,83950,156,0001,003,0002,363,392
7Dec 30, 2025 00:34138,29776,722,00249,164,0002,006,0002,367,488
8Dec 30, 2025 00:34138,50084,180,98249,236,0002,009,0002,355,200
9Dec 30, 2025 00:34138,59274,247,45050,274,0001,005,0002,285,568