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 listNov 20, 2025 23:25izotoffizotoffScore: 56,592Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2025 23:2556,1521,881,880,3001,840,009,00012,993,0002,326,528
2Nov 20, 2025 23:2556,4481,887,747,8811,850,803,00011,992,0002,330,624
3Nov 20, 2025 23:2556,4751,890,960,3271,847,702,00015,988,0002,330,624
4Nov 20, 2025 23:2556,5591,896,742,7771,849,455,00016,994,0002,330,624
5Nov 20, 2025 23:2556,5921,895,480,4301,852,555,00014,996,0002,330,624
6Nov 20, 2025 23:2556,6751,900,044,9001,854,268,00015,993,0002,371,584
7Nov 20, 2025 23:2556,8651,907,787,1911,865,547,00010,991,0002,326,528
8Nov 20, 2025 23:2557,0031,906,160,1091,868,108,00012,993,0002,363,392
9Nov 20, 2025 23:2557,5921,932,229,7981,886,535,00013,989,0002,326,528