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 9, 2025 20:36Valentin KofmanValentin KofmanScore: 5,264Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2025 20:365,10072,634,09832,860,0008,961,0002,445,312
2Jul 9, 2025 20:365,26476,703,72931,120,00012,046,0002,473,984
3Jul 9, 2025 20:365,59168,234,17135,878,0009,966,0002,289,664