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 3, 2026 19:48TudyMTudyMScore: 30,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 19:5230,305909,166,818881,877,0008,902,0002,547,712
2May 3, 2026 19:5230,383911,506,567884,903,00011,024,0002,539,520
3May 3, 2026 19:5230,462913,877,187886,367,00011,405,0002,555,904
4May 3, 2026 19:5230,498914,942,592889,452,0009,979,0002,560,000
5May 3, 2026 19:5230,583917,513,425890,692,00010,065,0002,551,808
6May 3, 2026 19:5230,588917,653,892887,632,00010,978,0002,535,424
7May 3, 2026 19:5230,668920,061,141892,202,00011,125,0002,535,424
8May 3, 2026 19:5230,873926,196,853895,719,00010,069,0002,555,904
9May 3, 2026 19:5232,246967,380,124942,587,00010,192,0002,543,616