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 28, 2026 10:49Charles CabergsCharles CabergsScore: 72,543Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 10:5072,37844,612,22624,797,0001,983,0002,363,392
2Apr 28, 2026 10:5072,40842,697,32122,822,0003,969,0002,363,392
3Apr 28, 2026 10:5072,41847,512,56024,811,0001,984,0002,363,392
4Apr 28, 2026 10:5072,51047,719,23122,855,0003,974,0002,359,296
5Apr 28, 2026 10:5072,54342,672,09822,865,0003,976,0002,355,200
6Apr 28, 2026 10:5072,64346,326,18423,892,0002,986,0002,355,200
7Apr 28, 2026 10:5072,73539,527,22924,919,0001,993,0002,363,392
8Apr 28, 2026 10:5072,88345,398,38624,970,0001,997,0002,351,104
9Apr 28, 2026 10:5072,94341,767,30424,990,0001,999,0002,437,120