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 22, 2026 11:33M-RochatM-RochatScore: 23,206Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 11:3422,966688,997,716672,750,0006,197,0002,113,536
2May 22, 2026 11:3423,046691,406,424674,363,0006,102,0002,113,536
3May 22, 2026 11:3423,095692,877,988677,267,0006,144,0002,113,536
4May 22, 2026 11:3423,147694,437,665675,842,0006,114,0002,113,536
5May 22, 2026 11:3423,206696,182,623677,468,0006,272,0002,113,536
6May 22, 2026 11:3423,220696,619,011677,781,0006,211,0002,113,536
7May 22, 2026 11:3424,651739,555,222723,625,0006,363,0002,113,536
8May 22, 2026 11:3424,708741,257,149724,704,0006,514,0002,113,536
9May 22, 2026 11:3424,767743,016,936724,521,0006,313,0002,113,536