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 listAug 13, 2025 15:38Leon ZhaoLeon ZhaoScore: 15,598Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2025 15:3815,456534,056,765497,086,00012,976,0002,478,080
2Aug 13, 2025 01:2515,511538,287,569495,865,00015,995,0002,473,984
3Aug 13, 2025 01:2515,514541,284,602499,982,00011,975,0002,478,080
4Aug 13, 2025 01:2515,598547,272,685501,757,00012,993,0002,473,984
5Aug 13, 2025 15:3815,614545,223,288501,284,00013,980,0002,473,984
6Aug 13, 2025 15:3815,623543,592,689506,562,0008,992,0002,465,792