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 listJun 7, 2026 23:03anboto1anboto1Score: 11,688Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 23:0611,595391,948,058370,646,00012,001,0002,117,632
2Jun 7, 2026 23:0611,612392,996,546371,152,00012,055,0002,117,632
3Jun 7, 2026 23:0611,633393,094,338371,879,00012,012,0002,117,632
4Jun 7, 2026 23:0611,669394,833,571372,939,00012,156,0002,117,632
5Jun 7, 2026 23:0611,688395,337,086373,572,00012,160,0002,117,632
6Jun 7, 2026 23:0611,689397,686,989373,720,00012,048,0002,117,632
7Jun 7, 2026 23:0611,717396,455,481374,531,00012,147,0002,117,632
8Jun 7, 2026 23:0611,777397,899,259376,595,00012,060,0002,117,632
9Jun 7, 2026 23:0611,802398,758,369377,364,00012,107,0002,117,632