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 listJun 28, 2026 13:30Shikhar SoniShikhar SoniScore: 4,930Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 13:314,87449,427,62538,949,0001,020,0002,113,536
2Jun 28, 2026 13:314,90449,665,55739,193,0001,024,0002,113,536
3Jun 28, 2026 13:314,90849,771,75839,225,0001,022,0002,113,536
4Jun 28, 2026 13:314,90949,709,05139,239,0001,020,0002,113,536
5Jun 28, 2026 13:314,93049,905,58039,404,0001,024,0002,113,536
6Jun 28, 2026 13:314,99250,333,26339,914,0001,022,0002,113,536
7Jun 28, 2026 13:315,00150,466,98939,991,0001,021,0002,113,536
8Jun 28, 2026 13:315,01351,900,32640,088,0001,021,0002,113,536
9Jun 28, 2026 13:318,31877,586,31067,203,0001,012,0002,113,536