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 3, 2026 20:20TudyMTudyMScore: 24,152Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 20:2124,062721,870,156641,163,00064,073,0002,400,256
2May 3, 2026 20:2124,106723,206,715644,242,00062,326,0002,416,640
3May 3, 2026 20:2124,118723,540,363645,551,00063,281,0002,428,928
4May 3, 2026 20:2124,122723,666,868641,598,00065,202,0002,387,968
5May 3, 2026 20:2124,152724,564,024643,034,00065,145,0002,416,640
6May 3, 2026 20:2124,199725,992,562642,493,00065,119,0002,453,504
7May 3, 2026 20:2124,280728,427,858647,706,00065,136,0002,416,640
8May 3, 2026 20:2124,391731,758,092646,083,00066,641,0002,412,544
9May 3, 2026 20:2124,487734,618,970654,512,00062,400,0002,445,312