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 listJun 12, 2026 03:52Victor MerckléVictor MerckléScore: 67,059Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 03:5466,85432,290,52323,697,0001,039,0002,138,112
2Jun 12, 2026 03:5466,96233,854,13023,738,0001,038,0002,138,112
3Jun 12, 2026 03:5466,99133,799,12023,747,0001,040,0002,138,112
4Jun 12, 2026 03:5467,00533,992,70823,754,0001,038,0002,138,112
5Jun 12, 2026 03:5467,05933,803,14623,770,0001,042,0002,138,112
6Jun 12, 2026 03:5467,15133,957,50023,806,0001,040,0002,138,112
7Jun 12, 2026 03:5467,38634,107,22523,890,0001,043,0002,138,112
8Jun 12, 2026 03:5467,43232,563,35523,911,0001,039,0002,138,112
9Jun 12, 2026 03:54168,69172,450,54661,384,0001,032,0002,138,112