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 26, 2026 03:11Victor 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 26, 2026 03:12088,485,128235,312,0001,017,0002,662,400expected "1022811 ", got "1022810 "stderr
2Jun 26, 2026 03:122,83585,058,758228,974,0001,033,0002,658,304stderr
3Jun 26, 2026 03:122,84385,303,406227,718,0003,072,0002,662,400stderr
4Jun 26, 2026 03:122,86085,802,315229,981,0002,036,0002,662,400stderr
5Jun 26, 2026 03:122,86886,051,349229,932,0003,028,0002,662,400stderr
6Jun 26, 2026 03:122,87286,166,483229,748,0003,123,0002,662,400stderr
7Jun 26, 2026 03:122,93287,983,969230,843,0003,060,0002,662,400stderr
8Jun 26, 2026 03:122,94588,363,179232,211,0003,096,0002,658,304stderr
9Jun 26, 2026 03:122,95588,652,969232,270,0003,115,0002,662,400stderr