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 13, 2025 13:40Emanuele BolognesiEmanuele BolognesiScore: 21,504,224Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2025 13:4021,457,7307,966,881,2407,739,502,000199,858,0002,306,048
2Apr 13, 2025 13:4021,477,4147,979,355,9727,748,777,000197,866,0002,293,760
3Apr 13, 2025 13:4021,481,0227,977,436,0337,752,127,000195,851,0002,281,472
4Apr 13, 2025 13:4021,487,3497,989,126,2317,749,488,000200,831,0002,281,472
5Apr 13, 2025 13:4021,504,2247,997,284,8717,753,728,000202,835,0002,281,472
6Apr 13, 2025 13:4021,513,7927,995,499,1747,759,252,000200,851,0002,281,472
7Apr 13, 2025 13:4021,631,9978,038,226,8027,808,989,000194,850,0002,281,472
8Apr 13, 2025 13:4021,645,2738,043,093,2927,807,908,000200,843,0002,310,144
9Apr 13, 2025 13:4021,755,8818,081,031,5187,848,834,000200,842,0002,281,472