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 21, 2026 16:46Dominique GarmierDominique GarmierScore: 30,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 16:4630,336910,076,029876,606,0007,996,0002,654,208
2Mar 21, 2026 16:0530,393911,803,103874,738,00011,996,0002,756,608
3Mar 21, 2026 16:0530,444913,328,335874,924,0007,999,0002,637,824
4Mar 21, 2026 16:4630,452913,557,765875,501,0009,994,0002,658,304
5Mar 21, 2026 16:4630,484914,528,577879,213,0007,992,0002,682,880
6Mar 21, 2026 16:0530,575917,258,578876,908,00011,998,0002,625,536