TopK Sergey Svistunov

Find the sum of the 100 largest values in 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 uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listSep 8, 2025 21:19Aleksei ShahoikaAleksei ShahoikaScore: 3,523,241Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2025 21:193,506,9811,323,313,0671,296,584,000999,0002,519,040
2Sep 8, 2025 21:193,509,9141,321,986,7031,298,668,00002,285,568
3Sep 8, 2025 21:193,520,7301,325,993,8621,301,671,000999,0002,285,568
4Sep 8, 2025 21:193,522,7191,325,621,5721,301,407,0001,999,0002,277,376
5Sep 8, 2025 21:193,523,2411,326,670,8721,301,600,0001,999,0002,510,848
6Sep 8, 2025 21:193,524,1321,330,609,3681,302,930,000999,0002,285,568
7Sep 8, 2025 21:193,525,3301,327,843,5171,303,373,000999,0002,523,136
8Sep 8, 2025 21:193,526,7681,328,603,9221,302,906,0001,998,0002,285,568
9Sep 8, 2025 21:193,527,5351,329,199,5591,303,190,0001,998,0002,285,568