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 18, 2025 01:20Chandrasekaran AkashChandrasekaran AkashScore: 61,808Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 01:2061,75953,046,96822,851,00002,531,328
2Apr 18, 2025 01:2061,75944,253,35422,851,00002,531,328
3Apr 18, 2025 01:2061,76853,717,41621,861,000993,0002,531,328
4Apr 18, 2025 01:2061,77847,915,55921,865,000993,0002,449,408
5Apr 18, 2025 01:2061,80850,217,37720,881,0001,988,0002,445,312
6Apr 18, 2025 01:2061,84650,694,00720,894,0001,989,0002,531,328
7Apr 18, 2025 01:2061,88953,886,09420,908,0001,991,0002,531,328
8Apr 18, 2025 01:2062,00049,710,36621,943,000997,0002,531,328
9Apr 18, 2025 01:2062,40347,099,17421,082,0002,007,0002,523,136