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:32Chandrasekaran AkashChandrasekaran AkashScore: 61,878Success
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:3261,75452,063,12021,856,000993,0002,449,408
2Apr 18, 2025 01:3261,76854,915,91721,861,000993,0002,445,312
3Apr 18, 2025 01:3261,78953,451,05321,868,000994,0002,457,600
4Apr 18, 2025 01:3261,84148,673,30721,887,000994,0002,527,232
5Apr 18, 2025 01:3261,87844,311,32120,905,0001,990,0002,453,504
6Apr 18, 2025 01:3261,91942,693,67220,918,0001,992,0002,445,312
7Apr 18, 2025 01:3261,96249,960,66221,930,000996,0002,531,328
8Apr 18, 2025 01:3262,43846,537,50821,094,0002,008,0002,269,184
9Apr 18, 2025 01:3265,91445,827,76824,388,00002,453,504