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 5, 2026 00:10Victor MerckléVictor MerckléScore: 1,734Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 00:301,70351,102,271120,901,0002,036,0002,170,880stderr
2Sep 5, 2026 00:301,71351,418,724121,402,0001,020,0002,170,880stderr
3Sep 5, 2026 00:301,71451,434,751121,586,0002,005,0002,170,880stderr
4Sep 5, 2026 00:301,71651,485,523122,094,0001,021,0002,170,880stderr
5Sep 5, 2026 00:301,73452,030,101121,409,0001,011,0002,170,880stderr
6Sep 5, 2026 00:301,73852,154,985121,329,0002,017,0002,170,880stderr
7Sep 5, 2026 00:301,74452,326,871121,117,0001,029,0002,170,880stderr
8Sep 5, 2026 00:301,74552,370,643121,410,0001,021,0002,170,880stderr
9Sep 5, 2026 00:301,74952,487,063122,316,0001,021,0002,170,880stderr