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 listMar 17, 2025 23:00Aniruddha DebAniruddha DebScore: 69,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2025 23:0069,24150,861,68424,595,0001,024,0002,424,832
2Mar 17, 2025 23:0069,44352,082,11524,667,0001,027,0002,424,832
3Mar 17, 2025 23:0069,87852,855,07824,861,000994,0002,510,848