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 listMar 28, 2026 10:36Dominique GarmierDominique GarmierScore: 163,856Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 18:20162,1221,354,803,9411,324,404,0004,997,0002,383,872
2Mar 27, 2026 18:20163,7611,368,343,8911,341,838,000999,0002,375,680
3Mar 27, 2026 17:03163,8321,374,093,6211,341,421,0001,999,0002,445,312
4Mar 27, 2026 18:20163,8461,367,845,1011,340,542,0002,998,0002,441,216
5Mar 27, 2026 17:03163,8561,366,367,6831,341,624,0001,999,0002,453,504
6Mar 27, 2026 17:03164,3961,377,588,4551,346,053,0001,998,0002,338,816
7Mar 28, 2026 10:36164,4661,371,039,5021,348,620,00002,514,944
8Mar 28, 2026 10:36164,5231,377,737,3061,347,087,0001,998,0002,527,232
9Mar 28, 2026 10:36164,6511,377,286,3161,349,138,000999,0002,449,408