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 listJan 16, 2025 23:34Ian MckibbenIan MckibbenScore: 28,444,014Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2025 23:3428,416,39210,547,468,94410,512,066,0001,999,0002,277,376
2Jan 16, 2025 23:3428,444,01410,558,398,92810,522,287,0001,998,0002,281,472
3Jan 16, 2025 23:3428,480,44910,569,818,22610,536,767,000999,0002,281,472