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 listApr 26, 2026 19:49TudyMTudyMScore: 18,475Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 19:5017,996539,897,4351,426,340,00034,934,0002,748,416
2Apr 26, 2026 19:5018,254547,632,7461,435,046,00033,930,0002,678,784
3Apr 26, 2026 19:5018,351550,551,5151,457,514,00037,961,0002,617,344
4Apr 26, 2026 19:5018,407552,229,3771,471,322,00043,949,0002,715,648
5Apr 26, 2026 19:5018,475554,259,4571,477,663,00039,936,0003,043,328
6Apr 26, 2026 19:5018,541556,256,3651,446,759,00037,941,0002,633,728
7Apr 26, 2026 19:5018,726561,785,9281,477,910,00036,972,0003,006,464
8Apr 26, 2026 19:5018,732561,982,6231,484,101,00033,933,0002,740,224
9Apr 26, 2026 19:5020,350610,502,3641,639,965,00037,906,0002,752,512