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 22, 2025 19:14Drew GarciaDrew GarciaScore: 73,819Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2025 19:1473,50854,988,87226,191,0001,007,0002,408,448
2Apr 22, 2025 19:1473,53251,131,98224,184,0003,023,0002,400,256
3Apr 22, 2025 19:1473,60056,684,39225,215,0002,017,0002,269,184
4Apr 22, 2025 19:1473,72750,959,62025,259,0002,020,0002,269,184
5Apr 22, 2025 19:1473,81948,235,26925,290,0002,023,0002,408,448
6Apr 22, 2025 19:1473,86550,161,89426,318,0001,012,0002,396,160
7Apr 22, 2025 19:1474,03262,713,83525,363,0002,029,0002,404,352
8Apr 22, 2025 19:1474,03250,083,78523,334,0004,058,0002,269,184
9Apr 22, 2025 19:1474,08449,453,98126,396,0001,015,0002,269,184