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 listJul 1, 2025 20:56Adam FolwarcznyAdam FolwarcznyScore: 27,910Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2025 20:5625,932241,809,629193,674,00018,968,0002,441,216
2Jul 1, 2025 20:5627,910256,745,768203,876,00024,984,0002,383,872
3Jul 1, 2025 20:5630,832281,017,934231,837,00020,985,0002,510,848