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 19:55KeefeKeefeScore: 75,578Success
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 19:5575,35152,761,68826,848,0001,032,0002,273,280
2Apr 18, 2025 19:5575,36256,782,61326,889,000995,0002,273,280
3Apr 18, 2025 19:5775,46853,908,59325,929,0001,994,0002,273,280
4Apr 18, 2025 19:5775,47057,460,15226,927,000997,0002,400,256
5Apr 18, 2025 19:5575,48154,757,36025,934,0001,994,0002,273,280
6Apr 18, 2025 19:5575,50357,169,38925,941,0001,995,0002,273,280
7Apr 18, 2025 19:5575,57856,339,23325,967,0001,997,0002,273,280
8Apr 18, 2025 19:5575,65456,473,04026,993,000999,0002,396,160
9Apr 18, 2025 19:5575,73062,671,89826,019,0002,001,0002,273,280
10Apr 18, 2025 19:5575,74155,313,25727,024,0001,000,0002,408,448
11Apr 18, 2025 19:5575,80854,548,39027,048,0001,001,0002,273,280
12Apr 18, 2025 19:5775,81956,293,51327,052,0001,001,0002,273,280