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 listMay 17, 2026 10:39M-RochatM-RochatScore: 23,156Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 10:4221,531645,952,115629,188,0006,169,0002,129,920
2May 17, 2026 10:4221,635649,066,285631,177,0006,169,0002,129,920
3May 17, 2026 10:4221,760652,821,175638,216,0005,164,0002,129,920
4May 17, 2026 10:4222,148664,466,980646,700,0008,191,0002,129,920
5May 17, 2026 10:4223,156694,681,400677,782,0006,059,0002,134,016
6May 17, 2026 10:4223,207696,213,489680,516,0006,053,0002,129,920
7May 17, 2026 10:4223,380701,423,832686,431,0005,090,0002,129,920
8May 17, 2026 10:4223,541706,233,464689,777,0006,091,0002,129,920
9May 17, 2026 10:4223,553706,592,266690,937,0006,072,0002,134,016