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 4, 2026 23:29olliecrowolliecrowScore: 13,317Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 23:3012,933388,001,590363,351,0008,760,0002,424,832
2May 4, 2026 23:3013,181395,451,889367,971,00010,382,0002,404,352
3May 4, 2026 23:3013,220396,616,311371,266,0009,386,0002,404,352
4May 4, 2026 23:3013,302399,078,989372,936,0009,014,0002,433,024
5May 4, 2026 23:3013,317399,531,466372,027,0009,030,0002,412,544
6May 4, 2026 23:3013,331399,951,098373,692,00010,035,0002,416,640
7May 4, 2026 23:3013,354400,639,462374,118,0008,896,0002,408,448
8May 4, 2026 23:3013,433402,995,658373,096,0008,974,0002,420,736
9May 4, 2026 23:3013,479404,393,197373,258,0009,263,0002,424,832