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 24, 2024 19:09IhebIhebScore: 608,735Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2024 19:09602,803251,616,47890,015,000133,022,0002,297,856
2Dec 24, 2024 19:09605,114246,993,27088,957,000134,935,0002,383,872
3Dec 24, 2024 19:09605,149247,109,48288,962,000134,943,0002,310,144
4Dec 24, 2024 19:09605,592246,060,53489,027,000135,042,0002,420,736
5Dec 24, 2024 19:09608,735248,600,79389,092,000136,140,0002,441,216
6Dec 24, 2024 19:09608,919252,965,40890,120,000135,180,0002,412,544
7Dec 24, 2024 19:09610,135253,037,28289,900,000135,850,0002,412,544
8Dec 24, 2024 19:09615,224252,943,13889,855,000137,778,0002,285,568
9Dec 24, 2024 19:09615,800252,985,20289,939,000137,907,0002,326,528