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 listJan 22, 2025 23:35Oleg KovalovOleg KovalovScore: 346,457Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 23:35344,197156,494,80592,256,00035,097,0002,408,448
2Jan 22, 2025 23:35344,689150,905,30279,333,00048,202,0002,281,472
3Jan 22, 2025 23:35345,614152,727,36975,927,00051,950,0002,289,664
4Jan 22, 2025 23:35345,946150,499,40482,000,00046,000,0002,396,160
5Jan 22, 2025 23:35346,457150,700,00582,121,00046,068,0002,408,448
6Jan 22, 2025 23:35347,103154,420,91084,281,00044,147,0002,277,376
7Jan 22, 2025 23:35348,127155,121,71980,879,00047,928,0002,277,376
8Jan 22, 2025 23:35348,170155,041,23689,877,00038,946,0002,289,664
9Jan 22, 2025 23:35348,789151,901,78779,032,00050,020,0002,289,664