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 listAug 16, 2026 15:53Victor 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
1Aug 16, 2026 15:54068,475,063164,918,0001,006,0002,326,528expected "1025173 ", got "1011787 "stderr
2Aug 16, 2026 15:54066,857,848165,112,0002,033,0002,277,376expected "1024051 ", got "1010648 "stderr
3Aug 16, 2026 15:54065,947,761164,744,0001,268,0002,351,104expected "1026654 ", got "1013234 "stderr