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 listMar 15, 2026 19:06Elijah KinElijah KinScore: 227,273Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 19:06225,127104,117,43745,161,00038,136,0002,363,392
2Mar 15, 2026 19:06225,762105,535,77439,250,00044,282,0002,363,392
3Mar 15, 2026 19:06227,168110,122,90239,024,00045,028,0002,273,280
4Mar 15, 2026 19:06227,203110,941,54240,031,00044,034,0002,351,104
5Mar 15, 2026 19:06227,273107,717,24637,040,00047,051,0002,478,080
6Mar 15, 2026 19:06227,568110,806,58740,095,00044,105,0002,269,184
7Mar 15, 2026 19:06228,124106,124,74839,188,00045,218,0002,355,200
8Mar 15, 2026 19:06228,414106,424,56540,244,00044,269,0002,351,104
9Mar 15, 2026 19:06228,443110,901,97742,262,00042,262,0002,273,280