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 11, 2026 00:22Victor 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 11, 2026 00:26099,035,351251,008,0003,550,0002,150,400expected "1019818 ", got "1019817 "
2Jun 11, 2026 00:263,28498,535,928250,334,0003,526,0002,150,400
3Jun 11, 2026 00:263,28898,664,043250,582,0003,244,0002,150,400
4Jun 11, 2026 00:263,334100,034,872253,190,0003,571,0002,150,400
5Jun 11, 2026 00:263,334100,027,719254,615,0003,596,0002,150,400
6Jun 11, 2026 00:263,361100,836,543256,145,0003,614,0002,150,400
7Jun 11, 2026 00:263,373101,203,821254,650,0003,616,0002,211,840
8Jun 11, 2026 00:263,411102,333,953257,264,0003,552,0002,166,784
9Jun 11, 2026 00:263,428102,851,511258,537,0003,625,0002,150,400