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 06:56Josu San MartinJosu San MartinScore: 24,339Success
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 06:5623,731225,023,995193,595,0001,003,0002,449,408
2Jan 18, 2026 06:5624,339227,927,497198,575,0001,002,0002,351,104
3Jan 18, 2026 06:5624,747232,175,311201,924,000999,0002,359,296