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 listJun 8, 2026 02:54Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 02:560112,269,845303,979,0002,172,0002,146,304expected "1019742 ", got "1019741 "
2Jun 8, 2026 02:563,733112,009,575303,907,0002,176,0002,146,304
3Jun 8, 2026 02:563,741112,233,319303,986,0002,140,0002,142,208
4Jun 8, 2026 02:563,776113,284,362304,996,0002,122,0002,146,304
5Jun 8, 2026 02:563,781113,438,027310,205,0002,177,0002,146,304
6Jun 8, 2026 02:563,804114,137,905307,924,0001,159,0002,146,304
7Jun 8, 2026 02:563,914117,428,146312,958,0002,154,0002,142,208
8Jun 8, 2026 02:563,918117,553,675313,458,0002,203,0002,142,208
9Jun 8, 2026 02:563,934118,028,579318,109,0002,292,0002,150,400