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 listJun 26, 2026 00:11Victor MerckléVictor MerckléScore: 2,944Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 00:122,93187,951,422235,033,0003,217,0002,662,400
2Jun 26, 2026 00:122,93688,084,608237,315,0002,179,0002,662,400
3Jun 26, 2026 00:122,93988,173,425235,113,0003,093,0002,662,400
4Jun 26, 2026 00:122,94288,278,217236,080,0003,149,0002,658,304
5Jun 26, 2026 00:122,94488,328,303236,123,0003,157,0002,662,400
6Jun 26, 2026 00:122,94588,351,973235,150,0003,167,0002,662,400
7Jun 26, 2026 00:122,94988,482,089234,887,0003,192,0002,662,400
8Jun 26, 2026 00:122,95188,538,885236,205,0003,114,0002,662,400
9Jun 26, 2026 00:122,97689,286,577238,512,0002,091,0002,662,400