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 18, 2025 21:02Drew GarciaDrew GarciaScore: 76,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 21:0276,23554,237,83926,193,0002,014,0002,269,184
2Apr 18, 2025 21:0276,41952,150,51126,256,0002,019,0002,281,472
3Apr 18, 2025 21:0276,58661,276,06624,289,0004,048,0002,281,472
4Apr 18, 2025 21:0276,67056,674,88125,329,0003,039,0002,277,376
5Apr 18, 2025 21:0276,74352,232,34427,381,0001,014,0002,281,472
6Apr 18, 2025 21:0276,86852,529,17125,394,0003,047,0002,269,184
7Apr 18, 2025 21:0277,01648,193,85727,479,0001,017,0002,281,472
8Apr 18, 2025 21:0280,18958,411,48324,725,0004,945,0002,281,472
9Apr 18, 2025 21:02396,343172,768,680145,643,0001,004,0002,273,280