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 29, 2025 15:50Josu San MartinJosu San MartinScore: 176,751Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 15:50176,03092,939,44863,127,0002,004,0002,486,272
2Dec 29, 2025 15:50176,19587,897,43364,190,0001,002,0002,289,664
3Dec 29, 2025 15:50176,33288,234,66964,240,0001,003,0002,367,488
4Dec 29, 2025 15:50176,51992,263,92764,308,0001,004,0002,367,488
5Dec 29, 2025 15:50176,75188,538,97365,398,00002,289,664
6Dec 29, 2025 15:50176,97889,233,95665,482,00002,289,664
7Dec 29, 2025 15:50177,08193,575,99964,512,0001,008,0002,367,488
8Dec 29, 2025 15:50177,33091,866,80663,624,0001,988,0002,289,664
9Dec 29, 2025 15:50178,15198,672,14564,902,0001,014,0002,367,488