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 listNov 10, 2025 15:35izotoffizotoffScore: 120,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2025 15:35119,65465,632,65142,260,0002,012,0002,437,120
2Nov 10, 2025 15:35120,47673,048,06944,576,00002,322,432
3Nov 10, 2025 15:35121,22769,510,75744,854,00002,433,024