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 listJul 28, 2024 17:15Joad 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
1Jul 28, 2024 17:1500000Error: expected "1020478 ", got "1020477 "stderr
2Jul 28, 2024 17:1500000Error: expected "1020758 ", got "1020755 "stderr
3Jul 28, 2024 17:1500000Error: expected "1020569 ", got "1020568 "stderr
4Jul 28, 2024 17:1500000Error: expected "1021357 ", got "1021356 "stderr
5Jul 28, 2024 17:1500000Error: expected "1025612 ", got "1025611 "stderr
6Jul 28, 2024 17:153,244173,621,617107,050,13002,236,416
7Jul 28, 2024 17:153,248167,807,709107,184,50202,240,512
8Jul 28, 2024 17:153,254163,157,333107,371,07402,236,416