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 listSep 9, 2024 16:16Jatin YadavJatin YadavScore: 59,879Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2024 16:1659,4611,985,406,3661,929,215,00032,986,0002,408,448
2Sep 9, 2024 16:1659,8791,999,379,6661,947,035,00028,985,0002,281,472
3Sep 9, 2024 16:1660,8212,030,879,1671,971,108,00035,983,0002,424,832