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 6, 2024 20:36Joad 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 6, 2024 20:3600000Error: expected "1025236 ", got "1025235 "stderr
2Jul 6, 2024 20:3700000Error: expected "1019936 ", got "1019935 "stderr
3Jul 6, 2024 20:3700000Error: expected "1019971 ", got "1019970 "stderr
4Jul 6, 2024 20:3700000Error: expected "1022288 ", got "1022287 "stderr
5Jul 6, 2024 20:3700000Error: expected "1024534 ", got "1024435 "stderr
6Jul 6, 2024 20:3700000Error: expected "1024348 ", got "1024346 "stderr
7Jul 6, 2024 20:3700000Error: No answer to stdout. Died or killed?stderr