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 listFeb 7, 2026 04:53Josu San MartinJosu San MartinScore: 3,942Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 04:533,79858,158,09028,127,0003,013,0002,523,136
2Feb 7, 2026 04:533,89355,166,89929,925,0001,995,0002,510,848
3Feb 7, 2026 04:533,92762,541,07430,190,0002,012,0002,297,856
4Feb 7, 2026 04:563,93464,018,11628,227,0004,032,0002,514,944
5Feb 7, 2026 04:533,94257,872,12530,305,0002,020,0002,494,464
6Feb 7, 2026 04:563,94953,446,61928,334,0004,047,0002,494,464
7Feb 7, 2026 04:563,96857,093,94329,487,0003,050,0002,437,120
8Feb 7, 2026 04:5311,435120,508,80188,776,0004,987,0002,285,568
9Feb 7, 2026 04:5311,508119,546,90692,359,0002,007,0002,383,872