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 listNov 21, 2025 01:32izotoffizotoffScore: 39,748Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 21, 2025 01:3337,9041,137,128,8581,096,643,0008,988,0002,560,000
2Nov 21, 2025 01:3237,9901,139,706,7431,106,213,0005,995,0002,854,912
3Nov 21, 2025 01:3338,6511,159,529,0481,128,211,0008,001,0002,498,560
4Nov 21, 2025 01:3239,7481,192,436,6611,160,061,0004,995,0002,625,536
5Nov 21, 2025 01:3242,4381,273,133,4941,241,662,0005,993,0002,732,032
6Nov 21, 2025 01:3344,4781,334,339,9141,300,959,0007,005,0002,396,160