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 01:09Victor MerckléVictor MerckléScore: 3,351Success
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 01:133,29598,850,793250,790,0003,541,0002,150,400
2Jun 11, 2026 01:133,30399,100,377251,619,0003,477,0002,150,400
3Jun 11, 2026 01:133,32999,872,806252,537,0003,476,0002,211,840
4Jun 11, 2026 01:133,344100,332,728253,867,0003,529,0002,150,400
5Jun 11, 2026 01:133,351100,559,425252,112,0003,498,0002,166,784
6Jun 11, 2026 01:133,355100,669,759253,699,0003,256,0002,211,840
7Jun 11, 2026 01:133,365100,964,702253,814,0003,485,0002,150,400
8Jun 11, 2026 01:133,377101,333,813255,112,0003,521,0002,150,400
9Jun 11, 2026 01:133,399101,973,885255,761,0003,535,0002,183,168