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 17, 2024 10:01Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2024 10:0000000Error: expected "1020446 ", got "1020708 "stderr
2Sep 16, 2024 09:574,947187,134,849147,226,00016,024,0002,461,696
3Sep 16, 2024 09:575,008200,161,907153,234,00012,018,0002,334,720
4Sep 17, 2024 10:015,019190,437,660149,658,00015,963,0002,461,696
5Sep 16, 2024 09:575,032191,465,925153,044,00013,003,0002,334,720
6Sep 17, 2024 10:015,035187,736,188153,146,00013,012,0002,461,696
7Sep 17, 2024 10:015,363203,179,681166,974,0009,998,0002,457,600