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 listSep 12, 2026 07:37Haha ExpertHaha ExpertScore: 102,442Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 07:3878,743654,834,809507,231,000138,469,0002,117,632
2Sep 12, 2026 07:3892,218765,627,640619,472,000136,720,0002,117,632
3Sep 12, 2026 07:3896,181798,217,451651,871,000136,816,0002,117,632
4Sep 12, 2026 07:38102,377848,952,859702,772,000136,726,0002,117,632
5Sep 12, 2026 07:38102,442849,467,974701,746,000138,284,0002,117,632
6Sep 12, 2026 07:38108,213896,850,299749,134,000138,215,0002,117,632
7Sep 12, 2026 07:38111,412922,333,581775,098,000138,482,0002,117,632
8Sep 12, 2026 07:38114,301945,903,784798,980,000138,291,0002,117,632
9Sep 12, 2026 07:38114,620949,343,853803,171,000136,718,0002,117,632