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 listApr 24, 2026 22:40olliecrowolliecrowScore: 5,773Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 22:415,616168,485,893413,083,00010,975,0002,674,688
2Apr 24, 2026 22:415,671170,130,184412,139,0009,979,0002,686,976
3Apr 24, 2026 22:415,677170,332,450412,157,0009,955,0002,437,120
4Apr 24, 2026 22:415,695170,851,860411,282,00010,954,0002,572,288
5Apr 24, 2026 22:415,773173,218,647412,299,0008,984,0002,592,768
6Apr 24, 2026 22:415,774173,220,941413,159,0008,981,0002,678,784
7Apr 24, 2026 22:415,816174,496,578419,613,00010,014,0002,592,768
8Apr 24, 2026 22:415,857175,733,286429,252,0008,984,0002,764,800
9Apr 24, 2026 22:415,877176,330,399414,150,0009,979,0002,363,392