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 15, 2024 00:07Joad 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 15, 2024 00:0700000Error: expected "1019453 ", got "1019450 "stderr
2Jul 15, 2024 00:0800000Error: expected "1026351 ", got "1026349 "stderr
3Jul 15, 2024 00:0800000Error: expected "1019221 ", got "1019217 "stderr
4Jul 15, 2024 00:0800000Error: expected "1018810 ", got "1018805 "stderr
5Jul 15, 2024 00:0800000Error: expected "1024079 ", got "1024076 "stderr
6Jul 15, 2024 00:0800000Error: expected "1025370 ", got "1025368 "stderr
7Jul 15, 2024 00:0800000Error: expected "1018291 ", got "1018288 "stderr
8Jul 15, 2024 00:0800000Error: expected "1025050 ", got "1025047 "stderr
9Jul 15, 2024 00:0800000Error: expected "1023127 ", got "1023125 "stderr
10Jul 15, 2024 00:0800000Error: expected "1020692 ", got "1020689 "stderr
11Jul 15, 2024 00:0800000Error: expected "1024423 ", got "1024422 "stderr