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 listJun 7, 2026 16:43anboto1anboto1Score: 31,032Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 16:4430,7051,023,062,2031,008,252,0005,013,0002,113,536
2Jun 7, 2026 16:4430,8781,028,733,0911,013,239,0005,745,0002,113,536
3Jun 7, 2026 16:4430,9181,029,563,7691,014,646,0005,655,0002,113,536
4Jun 7, 2026 16:4430,9401,030,930,3391,015,344,0005,707,0002,113,536
5Jun 7, 2026 16:4431,0321,035,230,4211,019,051,0005,009,0002,113,536
6Jun 7, 2026 16:4431,3391,043,881,5461,029,076,0005,141,0002,113,536
7Jun 7, 2026 16:4431,8471,060,361,8431,045,295,0005,672,0002,113,536
8Jun 7, 2026 16:4433,0751,101,238,1661,085,841,0005,655,0002,113,536
9Jun 7, 2026 16:4433,3981,111,500,4121,097,097,0005,065,0002,113,536