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 5, 2026 12:23Victor MerckléVictor MerckléScore: 5,241Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 12:255,229156,879,487429,819,00010,509,0002,977,792
2May 5, 2026 12:255,233157,002,431430,656,00010,275,0002,981,888
3May 5, 2026 12:255,234157,029,805428,458,00014,663,0002,711,552
4May 5, 2026 12:255,240157,206,753433,441,00010,179,0002,703,360
5May 5, 2026 12:255,241157,234,022430,439,00013,642,0002,711,552
6May 5, 2026 12:255,249157,474,487430,836,00010,279,0002,977,792
7May 5, 2026 12:255,262157,870,096427,359,00014,440,0002,711,552
8May 5, 2026 12:255,264157,932,505425,818,00013,445,0002,715,648
9May 5, 2026 12:255,314159,442,688434,310,00010,858,0002,699,264