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 20:39TudyMTudyMScore: 69,355Success
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 20:4267,7792,033,386,8211,994,943,00019,459,0002,469,888
2May 3, 2026 20:4268,9122,067,372,2692,029,541,00020,560,0002,473,984
3May 3, 2026 20:4269,0742,072,234,2412,032,803,00020,492,0002,478,080
4May 3, 2026 20:4269,1992,075,981,7332,034,672,00021,740,0002,392,064
5May 3, 2026 20:4269,3552,080,661,0152,041,109,00020,413,0002,478,080
6May 3, 2026 20:4269,4162,082,492,0112,044,871,00019,637,0002,478,080
7May 3, 2026 20:4269,8912,096,735,4182,059,367,00018,615,0002,486,272
8May 3, 2026 20:4272,1942,165,823,2782,127,064,00021,372,0002,469,888
9May 3, 2026 20:4275,5772,267,335,9382,225,492,00023,717,0002,478,080