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 26, 2026 05:34limanjun99limanjun99Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 05:360776,575,668680,240,00082,907,0002,449,408expected "1019696 ", got "1019696nani:1112800460,back:167222700,front:2531129080,"
2Apr 26, 2026 05:360787,772,002674,059,00089,007,0002,367,488expected "1019016 ", got "1019016nani:1108071076,back:165576120,front:2530694320,"
3Apr 26, 2026 05:360786,683,427704,400,00065,943,0002,371,584expected "1020587 ", got "1020587nani:1118439584,back:168499044,front:2555263484,"