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 22:04Elijah KinElijah KinScore: 146,800Success
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 22:04145,77680,273,11410,987,00042,950,0002,318,336
2Mar 15, 2026 22:04145,96278,332,36110,001,00044,005,0002,519,040
3Mar 15, 2026 22:04146,06878,893,7777,005,00047,040,0002,326,528
4Mar 15, 2026 22:04146,28978,371,36212,028,00042,099,0002,260,992
5Mar 15, 2026 22:04146,80073,992,05919,111,00035,205,0002,330,624
6Mar 15, 2026 22:04146,99779,680,80110,072,00044,317,0002,330,624
7Mar 15, 2026 22:04147,22274,712,15313,113,00041,359,0002,260,992
8Mar 15, 2026 22:04147,61984,634,74222,252,00032,367,0002,519,040
9Mar 15, 2026 22:04149,92476,586,94918,154,00037,318,0002,260,992