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 listSep 3, 2026 04:04Josu San MartinJosu San MartinScore: 4,141Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 04:054,09343,694,51531,315,0002,248,0002,113,536
2Sep 3, 2026 04:054,10644,470,32531,421,0002,249,0002,113,536
3Sep 3, 2026 04:054,12243,878,10831,567,0002,238,0002,113,536
4Sep 3, 2026 04:054,13143,910,41731,470,0002,409,0002,113,536
5Sep 3, 2026 04:054,14143,988,75331,745,0002,212,0002,113,536
6Sep 3, 2026 04:054,17144,914,85031,937,0002,271,0002,113,536
7Sep 3, 2026 04:054,17244,975,68632,157,0002,058,0002,113,536
8Sep 3, 2026 04:0515,173134,445,776122,096,0002,327,0002,117,632
9Sep 3, 2026 04:0515,894141,102,787128,130,0002,207,0002,117,632