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 12, 2023 12:50matsuoka-601matsuoka-601Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2023 12:5100000Error: expected "1024552 ", got "1024550 "stderr
2Sep 12, 2023 12:5200000Error: expected "1019278 ", got "1019276 "stderr
3Sep 12, 2023 12:5300000Error: expected "1019609 ", got "1019608 "stderr
4Sep 13, 2023 16:1300000Error: expected "1018557 ", got "1018554 "stderr
5Sep 12, 2023 12:504,705230,761,772155,264,16402,203,648
6Sep 12, 2023 12:504,728225,412,164156,038,34602,195,456
7Sep 12, 2023 12:504,768212,737,151157,334,09202,195,456