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 07:52Victor 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 07:5201,182,928,9291,155,709,0001,999,0002,301,952expected "1020542 ", got "30000000 "stderr
2Apr 27, 2026 07:5201,178,091,8531,153,262,0002,998,0002,785,280expected "1019519 ", got "30000000 "stderr
3Apr 27, 2026 07:5201,214,582,3321,192,379,0001,998,0002,314,240expected "1021421 ", got "30000000 "stderr