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 listJul 6, 2025 12:12Valentin KofmanValentin KofmanScore: 21,068Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2025 12:1221,060196,492,680170,692,0001,996,0002,269,184
2Jul 6, 2025 12:1221,068200,793,738171,758,000998,0002,269,184
3Jul 6, 2025 12:1221,174201,819,040172,629,000997,0002,269,184