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 17:04Shikhar SoniShikhar SoniScore: 40,241Success
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 17:0539,8101,194,323,3141,160,796,00023,466,0002,117,632
2Jun 26, 2026 17:0539,8491,195,474,7871,161,843,00023,455,0002,117,632
3Jun 26, 2026 17:0539,8501,195,526,6481,161,511,00023,741,0002,117,632
4Jun 26, 2026 17:0539,8511,195,548,3541,162,291,00023,171,0002,117,632
5Jun 26, 2026 17:0540,2411,207,248,6871,173,481,00023,685,0002,117,632
6Jun 26, 2026 17:0540,4071,212,211,5041,178,025,00023,929,0002,117,632
7Jun 26, 2026 17:0540,7051,221,156,1461,185,613,00025,174,0002,117,632
8Jun 26, 2026 17:0540,7221,221,684,1321,185,765,00025,446,0002,117,632
9Jun 26, 2026 17:0540,8421,225,265,4891,189,616,00025,312,0002,117,632