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 28, 2024 13:03Joad NacerJoad NacerScore: 21,522,214Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2024 13:0321,498,6408,024,954,3847,954,496,82002,293,760
2Apr 28, 2024 13:0321,515,1898,023,997,4837,960,619,91702,293,760
3Apr 28, 2024 13:0321,518,0238,015,236,0817,961,668,36402,285,568
4Apr 28, 2024 13:0321,522,0788,023,044,8657,963,168,97402,293,760
5Apr 28, 2024 13:0321,522,2148,021,857,4817,963,219,14702,293,760
6Apr 28, 2024 13:0321,590,3598,049,284,7037,988,432,72502,293,760
7Apr 28, 2024 13:0321,627,0468,061,220,9448,002,007,01702,293,760
8Apr 28, 2024 13:0321,692,5488,083,403,5138,026,242,70402,297,856
9Apr 28, 2024 13:0321,717,8688,090,752,6098,035,611,23802,289,664