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:34Chandrasekaran AkashChandrasekaran AkashScore: 70,730Success
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:3470,35947,811,32425,032,0001,001,0002,449,408
2Apr 11, 2025 05:3470,36855,843,05324,034,0002,002,0002,449,408
3Apr 11, 2025 05:3470,56858,266,06925,106,0001,004,0002,445,312
4Apr 11, 2025 05:3470,71949,279,91525,160,0001,006,0002,449,408
5Apr 11, 2025 05:3470,73047,798,67924,157,0002,013,0002,445,312
6Apr 11, 2025 05:3470,77048,387,65625,178,0001,007,0002,531,328
7Apr 11, 2025 05:3470,91146,119,31725,228,0001,009,0002,265,088
8Apr 11, 2025 05:3471,05945,872,47226,292,00002,441,216
9Apr 11, 2025 05:3471,06545,019,44725,283,0001,011,0002,531,328