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 8, 2026 22:31IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 22:33031,355,74320,475,0001,163,0002,113,536expected "429496518218 ", got "429496595864 "
2Jul 8, 2026 22:33031,276,34920,481,0001,104,0002,113,536expected "429496508476 ", got "429496572306 "
3Jul 8, 2026 22:33031,661,67920,598,0001,208,0002,113,536expected "429496492695 ", got "429496566464 "