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 15:56Victor 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 15:56052,663,655035,044,0002,379,776Exit with code 1: probe_v=input_size_1 stdin_regular=1 st_size=300368663 early=1 unexpected_stdin=0 fstat_errno=0 probe_v=input_size_1 stdin_regular=1 st_size=300368663 bytes_read=300368663 read_calls=288 eof_seen=1 elapsed_ms=33.544 first_read_ms=0.42...stderr