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 listApr 20, 2026 23:44Taylor DettlingTaylor DettlingError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 23:450537,582,685511,567,0001,998,0002,347,008expected "1019763 ", got "193609744 "
2Apr 20, 2026 23:450537,566,769510,435,0001,000,0002,281,472expected "1020442 ", got "193609744 "
3Apr 20, 2026 23:450544,683,239509,621,0001,998,0002,306,048expected "1026741 ", got "193609744 "