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 08:43anboto1anboto1Score: 5,865Success
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 08:445,818201,275,304180,815,00011,193,0002,117,632
2Jun 8, 2026 08:445,829202,132,893180,320,00012,066,0002,117,632
3Jun 8, 2026 08:445,844202,157,308181,551,00011,319,0002,117,632
4Jun 8, 2026 08:445,854202,948,118181,708,00011,499,0002,117,632
5Jun 8, 2026 08:445,865202,796,261181,665,00011,884,0002,117,632
6Jun 8, 2026 08:445,868202,885,183181,702,00011,957,0002,117,632
7Jun 8, 2026 08:445,873203,058,415181,863,00011,953,0002,117,632
8Jun 8, 2026 08:445,898203,883,662182,619,00012,044,0002,117,632
9Jun 8, 2026 08:445,902204,543,787183,319,00011,476,0002,117,632