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 listJul 1, 2026 13:14IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 13:140114,982,381104,148,0001,122,0002,113,536expected "429496567211 ", got "429496729500 "
2Jul 1, 2026 13:140114,638,818103,938,0001,172,0002,113,536expected "429496539885 ", got "429496729488 "
3Jul 1, 2026 13:140115,680,780104,769,0001,158,0002,113,536expected "429496524988 ", got "429496729500 "