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 22:08anboto1anboto1Score: 11,417Success
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 22:1111,285381,881,076359,750,00012,667,0002,117,632
2Jun 7, 2026 22:1111,300382,746,499360,823,00012,093,0002,117,632
3Jun 7, 2026 22:1111,317382,764,484361,480,00011,997,0002,117,632
4Jun 7, 2026 22:1111,320383,284,889361,486,00012,088,0002,117,632
5Jun 7, 2026 22:1111,417386,520,682364,621,00012,151,0002,117,632
6Jun 7, 2026 22:1111,419386,112,516364,651,00012,189,0002,117,632
7Jun 7, 2026 22:1111,444387,423,322365,474,00012,202,0002,117,632
8Jun 7, 2026 22:1111,507389,467,666367,515,00012,218,0002,117,632
9Jun 7, 2026 22:1111,603395,228,109370,609,00012,294,0002,117,632