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 2, 2026 11:23Evgenii ZheltonozhskiiEvgenii ZheltonozhskiiScore: 125,137Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 11:25103,216855,946,131663,955,000182,417,0002,117,632
2Jul 2, 2026 11:25113,999944,399,397751,967,000182,828,0002,117,632
3Jul 2, 2026 11:25114,720950,246,210758,833,000181,876,0002,117,632
4Jul 2, 2026 11:25122,3451,012,805,496822,339,000180,892,0002,117,632
5Jul 2, 2026 11:25125,1371,035,672,663844,054,000182,075,0002,117,632
6Jul 2, 2026 11:25130,4661,079,410,782890,173,000179,654,0002,117,632
7Jul 2, 2026 11:25135,8021,123,211,192932,045,000181,539,0002,117,632
8Jul 2, 2026 11:25137,9591,140,784,586950,950,000180,318,0002,117,632
9Jul 2, 2026 11:25146,6661,212,231,5651,020,129,000182,538,0002,117,632