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 listNov 6, 2025 08:42izotoffizotoffScore: 230,581Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2025 08:42230,5147,637,680,0277,476,057,000130,895,0002,478,080
2Nov 6, 2025 08:42230,5817,631,645,4657,466,253,000142,909,0002,424,832
3Nov 6, 2025 08:42232,5467,708,263,1257,552,082,000121,920,0002,322,432