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 20, 2026 20:17A_ShamanA_ShamanScore: 582,327Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 20:18578,429224,734,280212,961,0001,058,0002,113,536
2Jun 20, 2026 20:18578,516223,078,357213,049,0001,002,0002,113,536
3Jun 20, 2026 20:18578,672223,168,289213,077,0001,032,0002,113,536
4Jun 20, 2026 20:18578,935223,261,569213,118,0001,088,0002,113,536
5Jun 20, 2026 20:18582,327224,602,494214,429,0001,032,0002,113,536
6Jun 20, 2026 20:18587,248226,417,462216,198,0001,084,0002,113,536
7Jun 20, 2026 20:18604,043232,468,451222,424,0001,072,0002,113,536
8Jun 20, 2026 20:18604,302232,623,841222,507,0001,085,0002,113,536
9Jun 20, 2026 20:18605,202232,956,651222,864,0001,061,0002,113,536