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 2, 2026 15:11IlyaIlyaScore: 62,813Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 15:1362,50232,635,76422,027,0001,099,0002,113,536
2Jul 2, 2026 15:1362,57532,634,63722,043,0001,110,0002,113,536
3Jul 2, 2026 15:1362,58632,704,40422,056,0001,101,0002,113,536
4Jul 2, 2026 15:1362,64032,722,49422,074,0001,103,0002,113,536
5Jul 2, 2026 15:1362,81332,684,78522,122,0001,119,0002,117,632
6Jul 2, 2026 15:1362,85632,724,35622,139,0001,118,0002,113,536
7Jul 2, 2026 15:1362,93532,723,46822,151,0001,135,0002,113,536
8Jul 2, 2026 15:1362,94033,329,80622,082,0001,206,0002,113,536
9Jul 2, 2026 15:1363,01833,241,17622,104,0001,213,0002,113,536