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 listMar 22, 2026 16:15olliecrowolliecrowScore: 14,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 12:5714,406501,676,372467,403,0008,006,0002,482,176
2Mar 22, 2026 12:5714,428506,008,905468,133,0008,002,0002,293,760
3Mar 22, 2026 16:1514,448502,111,674467,794,0008,996,0002,293,760
4Mar 22, 2026 12:5714,454509,043,407467,984,0008,999,0002,367,488
5Mar 22, 2026 16:1514,497510,187,368469,420,0008,988,0002,412,544
6Mar 22, 2026 16:1514,541503,630,939470,854,0008,997,0002,359,296