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 16:04Shikhar SoniShikhar SoniScore: 46,656Success
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 16:0646,4341,393,029,3391,191,220,000191,824,0002,113,536
2Jun 26, 2026 16:0646,4721,394,163,2521,190,463,000193,512,0002,117,632
3Jun 26, 2026 16:0646,4771,394,336,6641,193,611,000190,224,0002,117,632
4Jun 26, 2026 16:0646,4991,394,988,7661,193,898,000191,006,0002,117,632
5Jun 26, 2026 16:0646,6561,399,705,0411,191,627,000193,835,0002,117,632
6Jun 26, 2026 16:0646,6941,400,826,1971,194,147,000196,641,0002,117,632
7Jun 26, 2026 16:0646,6951,400,865,9331,196,014,000194,819,0002,117,632
8Jun 26, 2026 16:0646,8111,404,357,0701,201,808,000191,939,0002,117,632
9Jun 26, 2026 16:0647,0751,412,253,9461,205,412,000196,556,0002,117,632