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 listSep 26, 2026 19:52Kevin HeaveyKevin HeaveyScore: 1,682Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 19:541,63449,048,456108,185,0003,051,000585,728
2Sep 26, 2026 19:541,66249,876,415112,533,0000593,920
3Sep 26, 2026 19:541,66649,984,868112,110,0000593,920
4Sep 26, 2026 19:541,67550,270,834112,434,0000593,920
5Sep 26, 2026 19:541,68250,480,369112,023,0001,024,000593,920
6Sep 26, 2026 19:541,68350,506,071112,086,0001,038,000593,920
7Sep 26, 2026 19:541,68950,676,023112,544,0001,061,000593,920
8Sep 26, 2026 19:541,69650,908,511112,620,0000593,920
9Sep 26, 2026 19:541,70551,166,747112,147,0001,061,000593,920