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 13, 2025 14:31Emanuele BolognesiEmanuele BolognesiScore: 4,989,251Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2025 14:314,932,7083,080,976,4501,062,842,000762,260,0002,519,040
2Apr 13, 2025 14:314,947,7623,108,262,8371,087,302,000743,370,0002,551,808
3Apr 13, 2025 14:314,974,8003,087,464,2831,069,260,000771,416,0002,383,872
4Apr 13, 2025 14:314,982,4953,161,732,3961,086,291,000757,232,0002,449,408
5Apr 13, 2025 14:314,989,2513,040,555,0911,067,923,000778,100,0002,355,200
6Apr 13, 2025 14:314,990,9383,236,401,6091,073,290,000773,357,000299,008
7Apr 13, 2025 14:315,003,9083,127,995,4571,088,968,000762,478,0002,396,160
8Apr 13, 2025 14:315,009,3003,445,830,8971,092,171,000761,270,0002,449,408
9Apr 13, 2025 14:315,047,3053,088,489,5901,074,751,000792,752,0002,478,080