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 listNov 1, 2025 09:40AntonAntonScore: 74,365Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2025 09:4071,250608,130,602408,476,000175,774,0002,322,432
2Nov 1, 2025 09:4071,441607,045,459412,868,000172,945,0002,277,376
3Nov 1, 2025 09:4071,536610,239,365410,716,000175,878,0002,502,656
4Nov 1, 2025 09:4071,965617,545,609416,077,000174,032,0002,490,368
5Nov 1, 2025 09:4074,365631,400,827431,856,000177,940,0002,322,432
6Nov 1, 2025 09:4078,115664,974,841464,672,000175,875,0002,293,760
7Nov 1, 2025 09:4086,264731,786,838533,518,000173,843,0002,314,240
8Nov 1, 2025 09:4087,496740,421,586541,601,000175,870,0002,367,488
9Nov 1, 2025 09:4087,680750,254,773545,223,000173,752,0002,420,736