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 15, 2026 16:57Maya RebholzMaya RebholzScore: 5,093Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 16:584,92250,101,85237,907,0002,461,0002,113,536
2Jul 15, 2026 16:584,92850,210,92637,992,0002,424,0002,113,536
3Jul 15, 2026 16:584,96350,484,93838,224,0002,476,0002,113,536
4Jul 15, 2026 16:585,01450,924,60738,598,0002,518,0002,113,536
5Jul 15, 2026 16:585,09351,453,95539,227,0002,539,0002,113,536
6Jul 15, 2026 16:585,14151,978,24139,601,0002,561,0002,113,536
7Jul 15, 2026 16:585,29253,763,45140,990,0002,412,0002,113,536
8Jul 15, 2026 16:585,32553,495,27741,271,0002,396,0002,113,536
9Jul 15, 2026 16:586,14660,855,89747,973,0002,430,0002,113,536