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 00:49M-RochatM-RochatScore: 21,929Success
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 00:5121,626648,788,119635,608,0004,197,0002,113,536
2May 17, 2026 00:5121,682650,487,770637,360,0004,225,0002,113,536
3May 17, 2026 00:5121,694650,849,356637,827,0004,149,0002,113,536
4May 17, 2026 00:5121,870656,107,208641,436,0004,096,0002,117,632
5May 17, 2026 00:5121,929657,887,894642,030,0004,255,0002,113,536
6May 17, 2026 00:5122,197665,915,146652,971,0004,065,0002,113,536
7May 17, 2026 00:5122,264667,929,400653,176,0004,428,0002,113,536
8May 17, 2026 00:5122,302669,083,762655,356,0004,208,0002,113,536
9May 17, 2026 00:5122,343670,314,595654,495,0004,231,0002,113,536