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 listMar 20, 2026 20:24Yuriy LyfenkoYuriy LyfenkoScore: 9,399Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 20:156,616198,474,929503,219,0004,992,0002,736,128
2Mar 20, 2026 20:156,692200,762,008508,256,0002,989,0002,555,904
3Mar 20, 2026 20:156,973209,184,123518,624,0004,986,0002,887,680
4Mar 20, 2026 20:249,399281,971,979544,661,0003,968,0002,310,144
5Mar 20, 2026 20:2410,868326,036,330545,995,0002,951,0002,506,752
6Mar 20, 2026 20:2411,673350,199,336565,192,0006,844,0002,285,568