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 19:41anboto1anboto1Score: 14,008Success
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 19:4213,873468,824,083445,322,00012,498,0002,117,632
2Jun 7, 2026 19:4213,934469,055,111447,454,00012,368,0002,117,632
3Jun 7, 2026 19:4213,934469,630,422446,517,00013,328,0002,117,632
4Jun 7, 2026 19:4213,998471,174,476448,544,00013,412,0002,117,632
5Jun 7, 2026 19:4214,008472,146,121449,642,00012,650,0002,117,632
6Jun 7, 2026 19:4214,032472,510,104450,688,00012,391,0002,117,632
7Jun 7, 2026 19:4214,134476,259,714453,034,00013,409,0002,117,632
8Jun 7, 2026 19:4214,135475,684,500453,984,00012,478,0002,117,632
9Jun 7, 2026 19:4214,139475,884,042454,164,00012,426,0002,117,632