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 18:47Josu San MartinJosu San MartinScore: 34,299Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2025 05:4734,2641,159,506,299979,886,000150,828,0002,367,488
2Dec 23, 2025 05:4734,2871,160,411,842975,691,000155,791,0002,334,720
3Dec 27, 2025 18:4734,2981,162,837,006978,006,000153,843,0002,351,104
4Dec 23, 2025 05:4734,2991,157,732,475992,016,000139,861,0002,531,328
5Dec 27, 2025 18:4734,3011,162,495,746990,081,000141,868,0002,461,696
6Dec 27, 2025 18:4734,3351,159,365,561970,182,000162,862,0002,416,640