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 05:21Charles CabergsCharles CabergsScore: 9,598Success
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 05:214,68154,115,73636,365,0002,020,0002,355,200
2Apr 29, 2026 05:214,68956,571,91535,415,0003,035,0002,347,008
3Apr 29, 2026 05:214,72458,053,65436,753,0001,986,0002,359,296
4Apr 29, 2026 05:219,58996,788,45276,615,0002,016,0002,338,816
5Apr 29, 2026 05:219,59896,348,77574,725,0003,985,0002,441,216
6Apr 29, 2026 05:219,69895,120,98378,518,0001,006,0002,383,872
7Apr 29, 2026 05:219,70797,669,26476,576,0003,022,0002,490,368
8Apr 29, 2026 05:219,755100,586,79475,998,0003,999,0002,301,952
9Apr 29, 2026 05:219,79999,130,94879,352,0001,004,0002,310,144