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 listJan 10, 2026 18:24Pavel SkripkinPavel SkripkinScore: 59,579Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2026 18:2458,9641,971,094,4241,939,812,0005,996,0002,293,760
2Jan 10, 2026 18:2459,2841,988,441,3871,950,362,0005,998,0002,281,472
3Jan 10, 2026 18:2459,3761,990,323,1621,951,406,0007,997,0002,342,912
4Jan 10, 2026 18:2459,4451,990,715,8421,954,685,0006,995,0002,359,296
5Jan 10, 2026 18:2459,5791,997,418,6291,958,115,0007,996,0002,281,472
6Jan 10, 2026 18:2459,7542,000,002,8801,965,886,0005,996,0002,347,008
7Jan 10, 2026 18:2460,0402,008,355,5691,975,309,0005,997,0002,359,296
8Jan 10, 2026 18:2460,6592,034,769,0161,994,766,0006,995,0002,281,472
9Jan 10, 2026 18:2460,9102,042,270,4262,004,024,0005,997,0002,281,472