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 05:48anboto1anboto1Error
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 05:480189,400,626169,055,0009,734,0002,117,632expected "1025955 ", got "1025953 "
2Jun 8, 2026 05:480189,548,196170,363,0009,831,0002,117,632expected "1018973 ", got "1018970 "
3Jun 8, 2026 05:485,407187,633,345168,800,0009,637,0002,117,632