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 listJul 3, 2026 14:51A_ShamanA_ShamanScore: 87,965Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 14:5287,5972,627,930,0872,567,053,00048,691,0002,117,632
2Jul 3, 2026 14:5287,7952,633,853,5632,573,596,00047,927,0002,117,632
3Jul 3, 2026 14:5287,8202,634,607,2542,574,615,00047,868,0002,117,632
4Jul 3, 2026 14:5287,9182,637,560,4022,577,513,00047,894,0002,117,632
5Jul 3, 2026 14:5287,9652,638,956,8522,578,938,00047,881,0002,117,632
6Jul 3, 2026 14:5288,0242,640,722,3082,580,609,00047,890,0002,117,632
7Jul 3, 2026 14:5288,2132,646,402,0302,584,877,00048,883,0002,117,632
8Jul 3, 2026 14:5288,3042,649,138,3682,588,056,00048,275,0002,117,632
9Jul 3, 2026 14:5288,3502,650,529,0572,590,667,00047,763,0002,117,632