Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listOct 9, 2026 13:32highload-churnerhighload-churnerScore: 19,252Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 13:4019,155574,669,290557,436,0006,078,00024,576
2Oct 9, 2026 13:4019,214576,426,767560,018,0005,257,00024,576
3Oct 9, 2026 13:4019,219576,570,245559,859,0005,239,00024,576
4Oct 9, 2026 13:4019,243577,306,793559,204,0006,096,00024,576
5Oct 9, 2026 13:4019,252577,572,097560,193,0006,078,00024,576
6Oct 9, 2026 13:4019,324579,741,453562,640,0006,063,00024,576
7Oct 9, 2026 13:4019,346580,401,434563,016,0006,238,00024,576
8Oct 9, 2026 13:4019,358580,768,030562,985,0006,150,00024,576
9Oct 9, 2026 13:4019,425582,754,689565,408,0006,259,00024,576