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 24, 2026 10:03Victor MerckléVictor MerckléScore: 64,310Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 10:0463,81631,094,12522,519,0001,093,0002,113,536
2Jun 24, 2026 10:0464,10531,175,38622,681,0001,038,0002,113,536
3Jun 24, 2026 10:0464,19131,642,63922,665,0001,086,0002,113,536
4Jun 24, 2026 10:0464,31031,570,56122,729,0001,066,0002,113,536
5Jun 24, 2026 10:0464,31031,237,06822,749,0001,046,0002,113,536
6Jun 24, 2026 10:0464,38331,872,90722,755,0001,067,0002,113,536
7Jun 24, 2026 10:0464,41631,332,89622,779,0001,055,0002,113,536
8Jun 24, 2026 10:0464,59431,955,41022,767,0001,133,0002,113,536
9Jun 24, 2026 10:0464,73531,977,88522,895,0001,057,0002,113,536