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 12:47anboto1anboto1Score: 8,649Success
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 12:488,610293,416,362270,640,00013,491,0002,117,632
2Jun 8, 2026 12:488,613293,544,718270,678,00013,577,0002,117,632
3Jun 8, 2026 12:488,622293,789,151271,020,00013,538,0002,117,632
4Jun 8, 2026 12:488,624293,916,554271,177,00013,429,0002,117,632
5Jun 8, 2026 12:488,649294,663,601271,991,00013,449,0002,117,632
6Jun 8, 2026 12:488,682295,798,168272,824,00013,688,0002,117,632
7Jun 8, 2026 12:488,689296,417,005273,158,00013,591,0002,117,632
8Jun 8, 2026 12:488,691296,028,018273,148,00013,658,0002,117,632
9Jun 8, 2026 12:488,884311,060,838280,555,00012,631,0002,117,632