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 listApr 26, 2026 20:03TudyMTudyMScore: 25,503Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 20:0425,437232,603,411207,586,0001,002,0002,375,680
2Apr 26, 2026 20:0425,452224,978,798206,711,0001,997,0002,306,048
3Apr 26, 2026 20:0425,474223,777,205204,894,0003,997,0002,359,296
4Apr 26, 2026 20:0425,474226,409,265206,892,0001,998,0002,371,584
5Apr 26, 2026 20:0425,503228,222,596208,128,0001,000,0002,371,584
6Apr 26, 2026 20:0425,513226,475,822208,202,0001,005,0002,371,584
7Apr 26, 2026 20:0425,567225,700,025207,661,0001,996,0002,359,296
8Apr 26, 2026 20:0425,570229,373,399208,680,000998,0002,371,584
9Apr 26, 2026 20:0425,648226,026,788209,318,0001,001,0002,375,680