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:43Elijah KinElijah KinScore: 150,305Success
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:43148,77881,531,72013,011,00042,037,0002,314,240
2Mar 15, 2026 21:43150,30580,634,0809,100,00046,513,0002,273,280
3Mar 15, 2026 21:43151,42776,102,32212,006,00044,022,0002,326,528