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 08:54AntonAntonScore: 84,765Success
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 08:5467,553580,820,034383,955,000169,980,0002,322,432
2Nov 1, 2025 08:5470,420601,943,806402,615,000174,833,0002,273,280
3Nov 1, 2025 08:5478,094662,373,790467,539,000172,829,0002,330,624
4Nov 1, 2025 08:5484,683721,569,366519,549,000174,848,0002,400,256
5Nov 1, 2025 08:5484,765729,696,330520,304,000174,766,0002,506,752
6Nov 1, 2025 08:5487,539751,799,691543,109,000174,713,0002,383,872
7Nov 1, 2025 08:5493,344788,642,349587,555,000177,865,0002,314,240
8Nov 1, 2025 08:5494,954804,042,190606,705,000171,916,0002,314,240
9Nov 1, 2025 08:5497,354828,287,529620,457,000177,844,0002,293,760