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 16, 2026 22:54M-RochatM-RochatScore: 24,241Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 22:5723,769713,091,377699,538,0004,025,0002,113,536
2May 16, 2026 22:5723,834715,021,647702,674,0003,479,0002,113,536
3May 16, 2026 22:5723,957718,717,970705,872,0003,504,0002,113,536
4May 16, 2026 22:5724,120723,616,501710,121,0004,090,0002,113,536
5May 16, 2026 22:5724,241727,241,190711,370,0004,044,0002,113,536
6May 16, 2026 22:5724,291728,756,442712,925,0004,002,0002,113,536
7May 16, 2026 22:5725,270758,128,082742,844,0004,065,0002,113,536
8May 16, 2026 22:5726,464793,939,602781,455,0003,011,0002,113,536
9May 16, 2026 22:5726,481794,458,830782,321,0003,004,0002,113,536