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:03TudyMTudyMScore: 30,153Success
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:0729,917897,518,917871,518,00010,858,0002,555,904
2May 3, 2026 19:0730,018900,560,777875,326,0009,906,0002,555,904
3May 3, 2026 19:0730,074902,229,561876,183,0008,952,0002,551,808
4May 3, 2026 19:0730,108903,247,701876,935,0008,854,0002,551,808
5May 3, 2026 19:0730,153904,595,457875,428,00010,985,0002,551,808
6May 3, 2026 19:0730,238907,158,838880,435,0009,952,0002,555,904
7May 3, 2026 19:0730,349910,478,213884,576,00010,069,0002,551,808
8May 3, 2026 19:0730,359910,771,761883,398,00010,989,0002,547,712
9May 3, 2026 19:0730,531915,935,755890,088,00011,025,0002,539,520