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 21:32Elijah KinElijah KinScore: 148,703Success
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 21:32148,14686,505,94815,946,00038,868,0002,273,280
2Mar 15, 2026 21:32148,18180,935,46413,956,00040,871,0002,322,432
3Mar 15, 2026 21:32148,54378,053,14417,987,00036,974,0002,322,432
4Mar 15, 2026 21:32148,59285,530,90515,994,00038,985,0002,273,280
5Mar 15, 2026 21:32148,70387,383,04711,004,00044,016,0002,314,240
6Mar 15, 2026 21:32149,74975,117,22016,118,00039,289,0002,273,280
7Mar 15, 2026 21:32150,86577,102,52217,253,00038,567,0002,273,280
8Mar 15, 2026 21:32150,94378,918,93216,954,00038,895,0002,441,216
9Mar 15, 2026 21:32151,81976,343,17911,034,00045,139,0002,322,432