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 03:28M-RochatM-RochatScore: 20,901Success
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 03:3020,494614,833,150602,665,0003,244,0002,113,536
2May 17, 2026 03:3020,503615,118,585602,029,0003,351,0002,113,536
3May 17, 2026 03:3020,539616,192,012602,448,0003,296,0002,113,536
4May 17, 2026 03:3020,880626,425,387614,134,0003,319,0002,113,536
5May 17, 2026 03:3020,901627,057,125614,852,0003,304,0002,113,536
6May 17, 2026 03:3021,101633,031,980618,415,0003,331,0002,113,536
7May 17, 2026 03:3022,176665,280,777653,444,0003,011,0002,113,536
8May 17, 2026 03:3022,210666,321,312652,805,0003,009,0002,113,536
9May 17, 2026 03:3022,270668,113,550654,110,0003,009,0002,113,536