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 21, 2026 17:29M-RochatM-RochatScore: 21,732Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 17:3021,102633,060,659619,433,0004,070,0002,113,536
2May 21, 2026 17:3021,129633,875,022618,306,0004,282,0002,113,536
3May 21, 2026 17:3021,262637,870,283619,033,0004,260,0002,113,536
4May 21, 2026 17:3021,465643,967,228628,659,0004,242,0002,113,536
5May 21, 2026 17:3021,732651,986,862636,800,0004,159,0002,113,536
6May 21, 2026 17:3021,976659,282,342645,398,0004,330,0002,113,536
7May 21, 2026 17:3023,480704,423,249687,338,0004,236,0002,113,536
8May 21, 2026 17:3023,585707,569,809690,652,0004,286,0002,113,536
9May 21, 2026 17:3023,745712,369,119698,711,0004,017,0002,113,536