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 19, 2025 01:21KeefeKeefeScore: 78,022Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2025 01:2077,97052,996,59126,860,0001,989,0002,400,256
2Apr 19, 2025 01:2077,98659,846,40826,865,0001,990,0002,273,280
3Apr 19, 2025 01:2078,00853,360,78426,873,0001,990,0002,396,160
4Apr 19, 2025 01:2178,01958,297,39126,877,0001,990,0002,273,280
5Apr 19, 2025 01:2078,02256,426,45127,873,000995,0002,400,256
6Apr 19, 2025 01:2078,09560,514,51827,899,000996,0002,273,280
7Apr 19, 2025 01:2178,21652,773,68426,945,0001,995,0002,400,256
8Apr 19, 2025 01:2078,26558,851,54826,961,0001,997,0002,400,256
9Apr 19, 2025 01:2178,35956,783,69026,994,0001,999,0002,482,176