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 listAug 14, 2026 23:52Tomislav TunkovicTomislav TunkovicScore: 2,955Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 23:532,88786,624,320216,512,00011,128,0002,162,688
2Aug 14, 2026 23:532,90887,268,381220,130,00011,692,0002,162,688
3Aug 14, 2026 23:532,94988,487,771219,334,00010,686,0002,154,496
4Aug 14, 2026 23:532,94988,479,762223,899,00011,879,0002,162,688
5Aug 14, 2026 23:532,95588,660,162219,482,00012,636,0002,162,688
6Aug 14, 2026 23:532,97289,188,573223,919,00011,168,0002,162,688
7Aug 14, 2026 23:532,97589,278,422222,495,00011,743,0002,162,688
8Aug 14, 2026 23:533,01690,491,411226,460,00011,156,0002,162,688
9Aug 14, 2026 23:533,02290,679,451224,613,00012,172,0002,162,688