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 29, 2026 13:45TudyMTudyMScore: 17,542Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 13:5017,461164,689,516142,187,0001,001,0002,359,296
2Apr 29, 2026 13:5017,485161,811,205141,372,0002,005,0002,359,296
3Apr 29, 2026 13:5017,507158,065,933140,573,0002,990,0002,367,488
4Apr 29, 2026 13:5017,527158,359,220141,726,0001,996,0002,445,312
5Apr 29, 2026 13:5017,542165,171,648140,849,0002,996,0002,310,144
6Apr 29, 2026 13:5017,619162,935,797142,470,0002,006,0002,367,488
7Apr 29, 2026 13:5017,707169,246,490143,200,0002,002,0002,363,392
8Apr 29, 2026 13:5017,715164,404,577143,277,0001,989,0002,367,488
9Apr 29, 2026 13:5017,799162,369,884143,957,0001,999,0002,355,200