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 listOct 25, 2026 08:44Nao MinamiNao MinamiScore: 19,267Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 25, 2026 08:4519,064640,197,272608,421,00020,715,0002,113,536
2Oct 25, 2026 08:4519,107641,667,514609,777,00020,766,0002,113,536
3Oct 25, 2026 08:4519,182644,218,580612,418,00020,590,0002,113,536
4Oct 25, 2026 08:4519,240646,230,785614,259,00020,669,0002,113,536
5Oct 25, 2026 08:4519,267646,807,974615,844,00019,981,0002,113,536
6Oct 25, 2026 08:4519,480653,816,887622,296,00020,563,0002,113,536
7Oct 25, 2026 08:4519,486654,065,549622,343,00020,722,0002,113,536
8Oct 25, 2026 08:4519,505655,006,761623,052,00020,623,0002,113,536
9Oct 25, 2026 08:4519,657659,917,996628,671,00020,023,0002,113,536