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:40Haha ExpertHaha ExpertScore: 104,431Success
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:4182,567685,812,372537,914,000139,140,0002,117,632
2Sep 12, 2026 07:4188,078731,692,482585,656,000136,590,0002,117,632
3Sep 12, 2026 07:4193,280773,698,057626,734,000138,165,0002,117,632
4Sep 12, 2026 07:4197,947812,064,542666,791,000136,377,0002,117,632
5Sep 12, 2026 07:41104,431865,062,434717,225,000139,114,0002,117,632
6Sep 12, 2026 07:41107,589891,597,568745,886,000136,348,0002,117,632
7Sep 12, 2026 07:41107,675892,571,270745,864,000137,079,0002,117,632
8Sep 12, 2026 07:41108,352897,071,892749,127,000139,363,0002,117,632
9Sep 12, 2026 07:41125,9721,041,644,622894,028,000138,943,0002,117,632