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 listJan 13, 2026 01:30Josu San MartinJosu San MartinScore: 71,484Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 01:3070,88446,082,35124,210,0002,017,0002,289,664
2Jan 13, 2026 01:3071,48448,974,64825,432,0001,017,0002,359,296
3Jan 13, 2026 01:3071,72445,869,85726,538,00002,289,664