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 7, 2026 20:25Pavel SkripkinPavel SkripkinScore: 6,760Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 20:266,58569,784,35645,995,0008,006,0002,527,232
2May 7, 2026 20:266,66168,326,39946,648,0007,973,0002,387,968
3May 7, 2026 20:266,75271,418,10047,272,0008,095,0002,338,816
4May 7, 2026 20:266,75670,414,03246,915,0008,492,0002,486,272
5May 7, 2026 20:266,76069,325,79046,662,0008,774,0002,506,752
6May 7, 2026 20:266,89872,825,10547,699,0008,867,0002,383,872
7May 7, 2026 20:267,01169,925,61248,145,0009,347,0002,441,216
8May 7, 2026 20:267,05673,698,54148,686,0009,175,0002,457,600
9May 7, 2026 20:267,14273,955,80648,944,0009,627,0002,445,312