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 listNov 7, 2025 09:37AntonAntonScore: 22,920Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 7, 2025 09:3722,908213,452,163184,849,0002,997,0002,326,528
2Nov 7, 2025 09:3722,920215,148,454184,947,0002,999,0002,527,232
3Nov 7, 2025 09:3722,943211,246,873185,129,0003,002,0002,551,808