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 27, 2026 21:54TudyMTudyMScore: 19,961Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 21:5717,691530,733,4431,485,341,00031,985,0002,674,688
2Apr 27, 2026 21:5717,877536,324,4751,479,821,00042,994,0002,678,784
3Apr 27, 2026 21:5718,242547,263,8661,531,997,00040,973,0002,760,704
4Apr 27, 2026 21:5718,316549,504,7211,522,346,00049,945,0003,047,424
5Apr 27, 2026 21:5719,961598,845,9801,685,269,00041,907,0002,457,600
6Apr 27, 2026 21:5719,999599,972,1631,679,702,00040,919,0002,912,256
7Apr 27, 2026 21:5720,018600,553,4201,683,945,00046,887,0002,805,760
8Apr 27, 2026 21:5720,078602,352,6591,684,285,00045,898,0002,957,312
9Apr 27, 2026 21:5720,118603,556,8341,683,077,00048,886,0002,912,256