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 listApr 27, 2026 16:07Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 16:0803,333,084,2963,308,339,0002,998,000311,296Exit with code 1: early probe_v=task_probe_2 stdin_regular=1 st_size=300312987 unexpected_stdin=0 fstat_errno=0 probe_v=task_probe_2 stdin_regular=1 st_size=300312987 map_ok=1 unexpected_stdin=0 local_size_match=0 elapsed_ms=2921.625 deadline_exit=0 pa...stderr