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 8, 2026 03:18anboto1anboto1Score: 5,853Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 03:195,794200,475,304180,011,00011,192,0002,117,632
2Jun 8, 2026 03:195,809201,453,923180,384,00011,325,0002,117,632
3Jun 8, 2026 03:195,846202,266,281181,042,00011,882,0002,117,632
4Jun 8, 2026 03:195,849202,741,118181,733,00011,316,0002,117,632
5Jun 8, 2026 03:195,853202,493,668181,176,00011,978,0002,117,632
6Jun 8, 2026 03:195,868202,906,161181,781,00011,879,0002,117,632
7Jun 8, 2026 03:195,879203,799,802182,565,00011,444,0002,117,632
8Jun 8, 2026 03:195,907204,152,200182,908,00012,046,0002,117,632
9Jun 8, 2026 03:195,933205,027,515183,837,00011,981,0002,117,632