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 listApr 16, 2026 18:14olliecrowolliecrowScore: 556,122Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 18:14547,362230,987,13527,934,000174,590,0002,355,200
2Apr 16, 2026 18:14556,122230,815,87127,968,000177,797,0002,355,200
3Apr 16, 2026 18:14571,559240,393,82228,928,000182,549,0002,523,136