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 11, 2025 05:39Chandrasekaran AkashChandrasekaran AkashScore: 70,497Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2025 05:3970,37349,640,15325,037,0001,001,0002,441,216
2Apr 11, 2025 05:3970,44149,356,36525,061,0001,002,0002,445,312
3Apr 11, 2025 05:3970,46850,687,76224,068,0002,005,0002,453,504
4Apr 11, 2025 05:3970,47348,642,61025,073,0001,002,0002,527,232
5Apr 11, 2025 05:3970,49747,163,95625,081,0001,003,0002,531,328
6Apr 11, 2025 05:3970,61146,402,49024,117,0002,009,0002,531,328
7Apr 11, 2025 05:3970,69247,854,75825,150,0001,006,0002,449,408
8Apr 11, 2025 05:3970,74949,270,77525,171,0001,006,0002,449,408
9Apr 11, 2025 05:3970,77048,802,75025,178,0001,007,0002,531,328