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 listDec 27, 2025 20:35Josu San MartinJosu San MartinScore: 24,010Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2025 20:3523,811809,738,891777,760,0007,997,0002,326,528
2Dec 27, 2025 20:3523,860812,766,033778,374,0008,992,0002,351,104
3Dec 27, 2025 20:3523,896814,866,973779,581,0008,995,0002,486,272
4Dec 27, 2025 20:3523,952816,083,336783,413,0006,994,0002,441,216
5Dec 27, 2025 20:3524,010819,369,164785,346,0006,994,0002,514,944
6Dec 27, 2025 20:3524,050823,010,213783,660,0009,995,0002,367,488
7Dec 27, 2025 20:3524,069824,399,104785,270,0008,991,0002,490,368
8Dec 27, 2025 20:3524,093825,018,653787,069,0008,000,0002,318,336
9Dec 27, 2025 20:3525,129854,431,249821,265,0007,992,0002,408,448