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:06Valentin KofmanValentin KofmanScore: 18,243Success
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:0618,175171,557,002148,038,0001,000,0002,269,184
2Jul 6, 2025 12:0618,243177,576,254147,596,0001,994,0002,269,184
3Jul 6, 2025 12:0618,377185,652,560149,696,000997,0002,269,184