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 listJun 26, 2026 15:35Shikhar SoniShikhar SoniScore: 53,886Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 15:3752,7301,581,904,1551,484,768,00087,039,0002,117,632
2Jun 26, 2026 15:3753,0671,592,031,4241,491,670,00089,971,0002,117,632
3Jun 26, 2026 15:3753,4921,604,783,1001,506,064,00088,326,0002,117,632
4Jun 26, 2026 15:3753,7021,611,064,6471,511,130,00089,179,0002,117,632
5Jun 26, 2026 15:3753,8861,616,603,7271,513,587,00092,593,0002,117,632
6Jun 26, 2026 15:3753,8891,616,682,9691,513,880,00092,334,0002,117,632
7Jun 26, 2026 15:3753,9141,617,439,8011,517,668,00089,306,0002,117,632
8Jun 26, 2026 15:3753,9251,617,755,2161,517,727,00089,534,0002,113,536
9Jun 26, 2026 15:3754,1781,625,347,1321,523,488,00091,325,0002,117,632