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 listMay 21, 2026 17:37M-RochatM-RochatScore: 23,120Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 17:3821,723651,716,052634,667,0006,011,0002,129,920
2May 21, 2026 17:3821,770653,103,386632,770,0008,104,0002,129,920
3May 21, 2026 17:3821,799653,996,524637,021,0006,368,0002,129,920
4May 21, 2026 17:3822,219666,596,500650,680,0005,010,0002,129,920
5May 21, 2026 17:3823,120693,620,897677,217,0006,221,0002,129,920
6May 21, 2026 17:3824,010720,316,029703,977,0006,140,0002,129,920
7May 21, 2026 17:3824,065721,959,054705,522,0006,030,0002,129,920
8May 21, 2026 17:3824,144724,326,260707,937,0006,015,0002,129,920
9May 21, 2026 17:3824,255727,670,480709,174,0006,058,0002,129,920