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:38izotoffizotoffScore: 121,114Success
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:38120,57373,333,42143,599,0001,013,0002,437,120
2Nov 10, 2025 15:38121,11478,416,71742,821,0001,991,0002,322,432
3Nov 10, 2025 15:38121,34172,512,48843,899,000997,0002,428,928