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 listMay 3, 2026 13:56TudyMTudyMScore: 17,032Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 14:0216,947153,178,168137,837,0001,134,0002,387,968
2May 3, 2026 14:0216,964153,332,205137,951,0001,154,0002,387,968
3May 3, 2026 14:0217,022155,138,371138,451,0001,131,0002,375,680
4May 3, 2026 14:0217,022155,262,408138,421,0001,163,0002,379,776
5May 3, 2026 14:0217,032154,243,060138,511,0001,154,0002,387,968
6May 3, 2026 14:0217,043156,301,298138,605,0001,155,0002,367,488
7May 3, 2026 14:0217,142156,190,814139,441,0001,131,0002,367,488
8May 3, 2026 14:0217,152155,254,708139,477,0001,174,0002,363,392
9May 3, 2026 14:0217,297159,250,748140,674,0001,164,0002,387,968