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 16, 2025 14:39CemaCemaScore: 85,989Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2025 14:3984,27359,118,34030,176,0001,005,0002,277,376
2Mar 16, 2025 14:3985,98961,023,31629,828,0001,988,0002,289,664
3Mar 16, 2025 14:3986,03557,580,30529,844,0001,989,0002,273,280