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 listMar 4, 2026 00:59olliecrowolliecrowScore: 10,778Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 00:5910,650319,492,107849,003,0008,978,0002,514,944
2Mar 4, 2026 00:5910,676320,276,028844,800,0009,985,0002,510,848
3Mar 4, 2026 00:5910,684320,532,231849,614,0009,983,0002,699,264
4Mar 4, 2026 00:5910,719321,560,971841,765,0009,985,0002,637,824
5Mar 4, 2026 00:5910,778323,326,218845,513,0007,995,0002,527,232
6Mar 4, 2026 00:5910,868326,025,990854,656,00010,995,0002,396,160
7Mar 4, 2026 00:5910,977329,307,137868,572,0009,983,0002,691,072
8Mar 4, 2026 00:5910,993329,791,796856,995,0009,988,0002,732,032
9Mar 4, 2026 00:5911,126333,794,191881,529,0008,985,0002,396,160