Median Sergey Svistunov

Find the median of 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 median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listJan 1, 2026 04:51KeefeKeefeScore: 10,630Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 04:5110,466109,512,02483,823,0001,995,0002,482,176
2Jan 1, 2026 04:5110,630114,940,27484,160,0003,005,0002,408,448
3Jan 1, 2026 04:5110,723113,484,92784,928,0002,997,0002,486,272