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 3, 2026 20:18Josu San MartinJosu San MartinScore: 4,217Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 20:184,08859,467,93231,491,0002,031,0002,351,104
2Mar 3, 2026 20:184,21761,199,24833,563,0001,017,0002,387,968
3Mar 3, 2026 20:184,25461,415,06032,891,0001,993,0002,408,448