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 16:24chereshnya123chereshnya123Error
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 16:2609,035,044,7288,950,142,00075,046,0002,117,632expected "1022485 ", got "1021099"
2Jun 8, 2026 16:2609,033,233,1998,946,785,00076,590,0002,117,632expected "1026807 ", got "1025388"
3Jun 8, 2026 16:2608,959,486,1488,872,193,00077,321,0002,113,536expected "1021869 ", got "1020447"