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 7, 2026 23:14anboto1anboto1Score: 11,232Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 23:1711,133376,670,412354,771,00012,647,0002,117,632
2Jun 7, 2026 23:1711,155377,883,074356,135,00012,008,0002,117,632
3Jun 7, 2026 23:1711,158377,581,250355,589,00012,656,0002,117,632
4Jun 7, 2026 23:1711,214379,399,744358,029,00012,054,0002,117,632
5Jun 7, 2026 23:1711,232379,980,372358,459,00012,213,0002,117,632
6Jun 7, 2026 23:1711,250380,517,542358,565,00012,687,0002,117,632
7Jun 7, 2026 23:1711,261381,345,646359,609,00012,025,0002,117,632
8Jun 7, 2026 23:1711,267381,056,357359,049,00012,785,0002,117,632
9Jun 7, 2026 23:1711,280381,672,965359,431,00012,836,0002,117,632