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 listSep 4, 2026 10:02Victor MerckléVictor MerckléScore: 1,692Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 10:041,66549,964,195117,528,0001,005,0002,170,880stderr
2Sep 4, 2026 10:041,66950,086,829118,134,0002,039,0002,170,880stderr
3Sep 4, 2026 10:041,67950,390,949119,827,0001,308,0002,170,880stderr
4Sep 4, 2026 10:041,68150,454,794119,253,0001,018,0002,170,880stderr
5Sep 4, 2026 10:041,69250,765,174118,066,0001,024,0002,170,880stderr
6Sep 4, 2026 10:041,69250,760,872118,052,0002,019,0002,170,880stderr
7Sep 4, 2026 10:041,71151,341,192118,356,0001,039,0002,170,880stderr
8Sep 4, 2026 10:041,71651,485,284119,495,0001,031,0002,170,880stderr
9Sep 4, 2026 10:041,71651,484,279119,064,0001,025,0002,170,880stderr