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 04:15Victor 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 04:16093,926,068248,356,0003,218,0002,523,136expected "1025368 ", got "1025367 "
2Jun 26, 2026 04:163,09692,892,903246,054,0003,128,0002,527,232
3Jun 26, 2026 04:163,11193,345,617246,280,0003,139,0002,527,232
4Jun 26, 2026 04:163,11293,362,759246,071,0003,155,0002,527,232
5Jun 26, 2026 04:163,12093,626,295249,261,0001,048,0002,519,040
6Jun 26, 2026 04:163,12493,733,218247,872,0003,110,0002,519,040
7Jun 26, 2026 04:163,16995,098,072252,202,0003,139,0002,519,040
8Jun 26, 2026 04:163,20496,134,041250,127,0003,130,0002,650,112
9Jun 26, 2026 04:163,32499,725,275263,994,0003,108,0002,592,768