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 08:04M-RochatM-RochatScore: 20,678Success
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 08:0619,945598,375,917585,374,0003,317,0002,113,536
2May 17, 2026 08:0619,989599,698,043587,027,0003,156,0002,113,536
3May 17, 2026 08:0620,070602,129,530590,023,0003,239,0002,113,536
4May 17, 2026 08:0620,640619,205,737607,105,0003,161,0002,113,536
5May 17, 2026 08:0620,678620,341,244608,176,0003,180,0002,113,536
6May 17, 2026 08:0620,731621,946,816605,360,0003,140,0002,113,536
7May 17, 2026 08:0620,741622,252,152607,279,0003,206,0002,113,536
8May 17, 2026 08:0620,811624,335,754610,254,0003,224,0002,113,536
9May 17, 2026 08:0620,855625,652,971612,674,0003,214,0002,113,536