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 listJun 26, 2026 17:25Shikhar SoniShikhar SoniScore: 34,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 17:2634,2131,026,412,5571,006,699,0009,784,0002,125,824
2Jun 26, 2026 17:2634,3071,029,217,7661,009,553,0009,822,0002,125,824
3Jun 26, 2026 17:2634,3381,030,142,0631,009,964,0009,859,0002,125,824
4Jun 26, 2026 17:2634,3391,030,179,3621,010,799,0009,466,0002,125,824
5Jun 26, 2026 17:2634,3701,031,100,1271,010,147,00010,517,0002,125,824
6Jun 26, 2026 17:2634,3821,031,484,0541,010,201,0009,733,0002,125,824
7Jun 26, 2026 17:2634,4481,033,452,3331,013,149,00010,462,0002,125,824
8Jun 26, 2026 17:2634,5001,035,004,6681,015,432,0009,699,0002,125,824
9Jun 26, 2026 17:2634,5391,036,194,2761,016,254,0009,775,0002,125,824