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 5, 2026 21:00olliecrowolliecrowScore: 12,992Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 21:0412,887386,624,241367,856,00010,325,0002,531,328
2May 5, 2026 21:0412,948388,460,585369,423,00010,552,0002,527,232
3May 5, 2026 21:0412,950388,518,011369,588,00010,447,0002,519,040
4May 5, 2026 21:0412,963388,902,953370,097,00010,356,0002,555,904
5May 5, 2026 21:0412,992389,764,063371,003,00010,230,0002,527,232
6May 5, 2026 21:0413,045391,350,877372,232,00010,655,0002,531,328
7May 5, 2026 21:0413,122393,680,367374,439,00010,558,0002,531,328
8May 5, 2026 21:0413,146394,409,140375,204,00010,727,0002,523,136
9May 5, 2026 21:0413,285398,555,317379,097,00010,619,0002,535,424