Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 11:32Victor 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 11:33054,034,097036,852,0002,572,288Exit with code 1: probe_v=input_size_1 phase=start stdin_regular=1 st_size=300373488 probe_v=input_size_1 stdin_regular=1 st_size=300373488 bytes_read=300373488 read_calls=288 eof_seen=1 elapsed_ms=34.661 first_read_ms=0.420 max_read_ms=0.420 mb_per_s_...stderr