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 18:12M-RochatM-RochatScore: 24,005Success
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 18:1322,983689,513,771671,631,0006,135,0002,113,536
2May 22, 2026 18:1323,146694,382,272675,945,0006,106,0002,113,536
3May 22, 2026 18:1323,397701,915,333686,049,0006,227,0002,113,536
4May 22, 2026 18:1323,457703,738,521684,988,0006,297,0002,113,536
5May 22, 2026 18:1324,005720,177,370702,924,0007,629,0002,113,536
6May 22, 2026 18:1324,384731,544,534711,504,0006,574,0002,113,536
7May 22, 2026 18:1324,585737,555,779718,473,0006,419,0002,113,536
8May 22, 2026 18:1324,632738,989,805721,852,0006,435,0002,113,536
9May 22, 2026 18:1324,735742,068,798725,480,0006,332,0002,113,536