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 06:03anboto1anboto1Score: 5,839Success
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 06:045,790200,349,653180,945,00010,144,0002,117,632
2Jun 8, 2026 06:045,818201,284,762181,923,00010,091,0002,117,632
3Jun 8, 2026 06:045,820201,331,655181,921,00010,166,0002,117,632
4Jun 8, 2026 06:045,830201,638,211182,687,0009,717,0002,117,632
5Jun 8, 2026 06:045,839201,935,949182,518,00010,173,0002,117,632
6Jun 8, 2026 06:045,847202,183,418182,741,00010,236,0002,117,632
7Jun 8, 2026 06:045,863202,764,778183,230,00010,267,0002,117,632
8Jun 8, 2026 06:045,864203,113,739183,715,0009,800,0002,117,632
9Jun 8, 2026 06:045,876203,094,171183,617,00010,304,0002,117,632