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 listJun 21, 2026 06:34Elijah KinElijah KinScore: 106,818Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 06:35106,38148,443,04038,260,0001,101,0002,113,536
2Jun 21, 2026 06:35106,70248,547,59438,359,0001,121,0002,113,536
3Jun 21, 2026 06:35106,74848,446,85038,470,0001,027,0002,113,536
4Jun 21, 2026 06:35106,79448,515,49938,400,0001,114,0002,113,536
5Jun 21, 2026 06:35106,81848,590,85038,418,0001,105,0002,113,536
6Jun 21, 2026 06:35106,82948,484,30738,408,0001,119,0002,113,536
7Jun 21, 2026 06:35106,91348,489,63438,448,0001,110,0002,113,536
8Jun 21, 2026 06:35107,71848,807,06538,752,0001,104,0002,113,536
9Jun 21, 2026 06:35107,85148,989,85938,806,0001,099,0002,113,536