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, 2025 15:09thatmagicalcatthatmagicalcatScore: 140,311Success
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, 2025 15:09140,22282,984,28349,887,0001,995,0002,371,584
2Jun 21, 2025 15:09140,31182,429,31350,917,000998,0002,363,392
3Jun 21, 2025 15:09140,87075,723,02350,118,0002,004,0002,277,376