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 listDec 2, 2024 21:28mebowlermebowlerScore: 21,528,886Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 2, 2024 21:2821,421,1387,959,798,8077,721,980,000203,841,0002,277,376
2Dec 2, 2024 21:2821,427,3307,957,749,0627,725,263,000202,849,0002,498,560
3Dec 2, 2024 21:2821,480,9197,978,324,3577,771,053,000176,887,0002,277,376
4Dec 2, 2024 21:2821,504,2167,986,766,0417,762,693,000193,867,0002,277,376
5Dec 2, 2024 21:2821,528,8867,997,856,6167,778,837,000186,851,0002,277,376
6Dec 2, 2024 21:2821,585,6548,022,761,0477,780,829,000205,863,0002,306,048
7Dec 2, 2024 21:2821,609,7168,026,246,7047,804,725,000190,870,0002,277,376
8Dec 2, 2024 21:2821,619,3898,030,408,5957,801,319,000197,855,0002,314,240
9Dec 2, 2024 21:2821,658,3578,045,411,1977,818,748,000194,844,0002,269,184