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 11, 2025 23:01Drew GarciaDrew GarciaScore: 77,822Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2025 23:0177,23055,591,06125,514,0003,061,0002,281,472
2Apr 11, 2025 23:0177,26549,054,33325,525,0003,063,0002,277,376
3Apr 11, 2025 23:0177,48158,682,79925,597,0003,071,0002,281,472
4Apr 11, 2025 23:0177,51661,892,01324,584,0004,097,0002,281,472
5Apr 11, 2025 23:0177,82255,538,87026,809,0001,985,0002,289,664
6Apr 11, 2025 23:0177,97357,795,46926,861,0001,989,0002,281,472
7Apr 11, 2025 23:0178,04354,489,58526,885,0001,991,0002,281,472
8Apr 11, 2025 23:0178,08652,895,10626,900,0001,992,0002,281,472
9Apr 11, 2025 23:0178,34353,402,10325,989,0002,998,0002,281,472