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 6, 2025 19:54Aniruddha DebAniruddha DebScore: 33,952Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2025 19:5430,088274,704,424220,748,00025,970,0002,330,624
2May 6, 2025 19:5431,057283,497,019230,698,00023,968,0002,494,464
3May 6, 2025 19:5432,133287,571,318229,427,00034,063,0002,326,528
4May 6, 2025 19:5433,698302,797,648248,293,00028,033,0002,277,376
5May 6, 2025 19:5433,952306,188,234258,374,00020,029,0002,445,312
6May 6, 2025 19:5434,248306,333,888253,849,00026,984,0002,449,408
7May 6, 2025 19:5435,308316,946,074260,476,00029,053,0002,449,408
8May 6, 2025 19:5437,422329,944,753284,870,00021,990,0002,387,968
9May 6, 2025 19:5438,397341,867,474281,870,00032,984,0002,486,272