Unique strings Sergey Svistunov

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 listMay 24, 2025 15:42Emanuele BolognesiEmanuele BolognesiScore: 45,400Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2025 15:4244,5651,497,424,6551,435,638,00034,991,0002,441,216
2May 24, 2025 15:4244,7021,500,046,4721,443,177,00031,981,0002,465,792
3May 24, 2025 15:4244,7531,501,422,8561,438,887,00037,970,0002,269,184
4May 24, 2025 15:4245,3811,530,775,8681,462,576,00034,989,0002,428,928
5May 24, 2025 15:4245,4001,535,843,1681,462,219,00035,980,0002,420,736
6May 24, 2025 15:4245,4351,525,983,5951,464,370,00034,984,0002,412,544
7May 24, 2025 15:4245,5151,533,035,4111,460,036,00041,972,0002,424,832
8May 24, 2025 15:4245,5231,533,005,1491,465,271,00036,981,0002,408,448
9May 24, 2025 15:4245,7531,541,710,5211,473,874,00035,972,0002,281,472