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 28, 2026 21:16olliecrowolliecrowScore: 7,974Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 21:177,720231,625,132513,074,00026,951,0002,666,496
2Apr 28, 2026 21:177,721231,649,547513,550,00027,975,0002,551,808
3Apr 28, 2026 21:177,757232,729,871512,626,00031,037,0002,715,648
4Apr 28, 2026 21:177,882236,467,454535,810,00026,039,0002,756,608
5Apr 28, 2026 21:177,974239,221,501532,532,00030,030,0002,834,432
6Apr 28, 2026 21:178,021240,636,094533,615,00028,032,0002,682,880
7Apr 28, 2026 21:178,024240,739,908535,460,00026,022,0002,580,480
8Apr 28, 2026 21:178,079242,374,504532,927,00025,899,0002,666,496
9Apr 28, 2026 21:178,127243,838,494531,663,00029,868,0002,867,200