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 listJan 18, 2026 03:56Josu San MartinJosu San MartinScore: 12,077Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2026 03:5612,075122,273,02297,011,0002,000,0002,457,600
2Jan 18, 2026 03:5612,077120,681,16597,030,0002,000,0002,527,232
3Jan 18, 2026 03:5612,107130,937,79497,271,0002,005,0002,473,984