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 26, 2022 13:15Bernard TeoBernard TeoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2022 13:1600000Error: expected "1024819 ", got "1024818"
2Aug 26, 2022 13:1510,260402,439,646338,577,82602,273,280
3Aug 26, 2022 13:1610,266412,131,132338,766,57602,277,376
4Aug 26, 2022 13:1610,345402,755,642341,386,93502,285,568
5Aug 26, 2022 13:1510,419410,482,082343,830,59002,277,376
6Aug 26, 2022 13:1610,458415,011,987345,129,71802,281,472
7Aug 26, 2022 13:1510,737419,938,197354,304,60102,256,896