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:21Chandrasekaran AkashChandrasekaran AkashScore: 71,219Success
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:2071,04953,757,70126,288,00002,453,504
2Apr 18, 2025 01:2171,04945,103,59725,277,0001,011,0002,449,408
3Apr 18, 2025 01:2171,05949,243,94625,281,0001,011,0002,531,328
4Apr 18, 2025 01:2071,21657,704,32626,350,00002,269,184
5Apr 18, 2025 01:2171,21954,357,20126,351,00002,531,328
6Apr 18, 2025 01:2171,49747,264,11526,454,00002,449,408
7Apr 18, 2025 01:2171,49745,638,55226,454,00002,445,312
8Apr 18, 2025 01:2171,54153,632,65026,470,00002,445,312
9Apr 18, 2025 01:2071,67846,266,41026,521,00002,531,328