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 19:42M-RochatM-RochatScore: 20,562Success
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 19:4319,818594,540,744579,792,0004,031,0002,117,632
2May 22, 2026 19:4319,854595,648,929581,473,0004,040,0002,117,632
3May 22, 2026 19:4320,190605,729,147593,687,0004,095,0002,117,632
4May 22, 2026 19:4320,219606,589,489593,995,0004,194,0002,117,632
5May 22, 2026 19:4320,562616,880,148603,663,0004,200,0002,117,632
6May 22, 2026 19:4320,649619,489,440606,046,0004,089,0002,117,632
7May 22, 2026 19:4321,266637,999,699624,293,0004,126,0002,117,632
8May 22, 2026 19:4321,538646,152,417633,827,0004,036,0002,117,632
9May 22, 2026 19:4321,575647,260,978633,104,0004,142,0002,117,632