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 21, 2026 21:50BenBenScore: 20,139Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 21:5119,924597,723,1841,440,330,00096,022,0002,904,064
2Apr 21, 2026 21:5119,952598,586,6971,439,840,00094,989,0002,686,976
3Apr 21, 2026 21:5119,968599,055,9591,440,630,00093,975,0002,674,688
4Apr 21, 2026 21:5120,120603,602,3881,449,568,00084,916,0002,781,184
5Apr 21, 2026 21:5120,139604,174,8301,443,395,00086,843,0002,928,640
6Apr 21, 2026 21:5120,143604,309,3001,430,559,000101,826,0002,748,416
7Apr 21, 2026 21:5120,148604,451,5251,431,111,00098,938,0002,621,440
8Apr 21, 2026 21:5120,181605,447,8631,446,861,00089,176,0002,600,960
9Apr 21, 2026 21:5120,450613,516,6681,453,216,00092,013,0002,691,072