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:10Elijah KinElijah KinScore: 219,089Success
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:10218,338107,854,51733,910,00046,875,0002,506,752
2Mar 15, 2026 19:10219,089108,111,79436,028,00045,035,0002,506,752
3Mar 15, 2026 19:10236,095113,021,32543,175,00044,180,0002,269,184