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 00:12emily graceemily graceScore: 69,922Success
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 00:1169,81649,086,62023,845,0001,987,0002,269,184
2Apr 19, 2025 00:1169,86550,538,73623,862,0001,988,0002,273,280
3Apr 19, 2025 00:1269,88650,841,79423,869,0001,989,0002,273,280
4Apr 19, 2025 00:1269,92250,416,01324,876,000995,0002,273,280
5Apr 19, 2025 00:1270,13550,022,54423,954,0001,996,0002,289,664
6Apr 19, 2025 00:1170,17351,512,36323,967,0001,997,0002,269,184