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 listFeb 9, 2025 22:26NeoNeoScore: 144,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 9, 2025 22:26143,4394,767,852,6054,726,477,0006,996,0002,433,024
2Feb 9, 2025 22:26143,7094,772,806,6714,734,397,0007,993,0002,457,600
3Feb 9, 2025 22:26143,9814,784,735,9694,742,395,0008,993,0002,502,656
4Feb 9, 2025 22:26144,4464,795,895,4284,755,726,00010,992,0002,478,080
5Feb 9, 2025 22:26144,6144,803,814,0524,768,279,0003,997,0002,322,432
6Feb 9, 2025 22:26144,8304,804,235,3314,774,390,0004,997,0002,301,952
7Feb 9, 2025 22:26145,3594,825,184,3704,788,858,0007,993,0002,412,544
8Feb 9, 2025 22:26145,6984,832,063,6534,803,043,0004,995,0002,355,200
9Feb 9, 2025 22:26146,7624,876,487,4904,840,133,0002,997,0002,306,048