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 listJun 19, 2025 10:41Steve BronderSteve BronderScore: 68,505Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2025 10:4168,20345,821,31123,217,0002,018,0002,277,376
2Jun 19, 2025 10:4168,39549,939,59024,294,0001,012,0002,277,376
3Jun 19, 2025 10:4168,45446,610,75725,328,00002,539,520
4Jun 19, 2025 10:4168,46549,238,05825,332,00002,441,216
5Jun 19, 2025 10:4168,50547,201,90525,347,00002,539,520
6Jun 19, 2025 10:4168,75446,089,10225,439,00002,519,040
7Jun 19, 2025 10:4168,77647,844,19225,447,00002,539,520
8Jun 19, 2025 10:4168,84946,753,92725,474,00002,539,520
9Jun 19, 2025 10:4170,43847,278,23624,058,0002,004,0002,539,520