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:15anboto1anboto1Score: 5,847Success
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:165,781200,552,082179,568,00011,222,0002,117,632
2Jun 8, 2026 03:165,817201,231,263179,959,00012,013,0002,117,632
3Jun 8, 2026 03:165,831201,636,847180,577,00011,857,0002,117,632
4Jun 8, 2026 03:165,834202,339,402181,338,00011,211,0002,117,632
5Jun 8, 2026 03:165,847202,234,446181,666,00011,317,0002,117,632
6Jun 8, 2026 03:165,854202,447,503181,240,00011,970,0002,117,632
7Jun 8, 2026 03:165,866202,919,827182,170,00011,439,0002,117,632
8Jun 8, 2026 03:165,900203,893,743183,286,00011,417,0002,117,632
9Jun 8, 2026 03:165,907204,127,310183,500,00011,433,0002,117,632