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 listApr 26, 2026 18:12TudyMTudyMScore: 18,869Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 18:1318,191545,747,2861,422,922,00041,938,0002,732,032
2Apr 26, 2026 18:1318,293548,793,9491,419,266,00040,978,0002,932,736
3Apr 26, 2026 18:1318,636559,091,5631,449,431,00048,947,0002,879,488
4Apr 26, 2026 18:1318,754562,623,6901,468,668,00039,936,0002,318,336
5Apr 26, 2026 18:1318,869566,088,2281,480,356,00048,978,0002,658,304
6Apr 26, 2026 18:1319,009570,294,8271,487,912,00041,997,0002,678,784
7Apr 26, 2026 18:1319,066571,987,3591,487,536,00044,955,0002,613,248
8Apr 26, 2026 18:1319,236577,086,8761,485,037,00046,937,0002,949,120
9Apr 26, 2026 18:1320,538616,152,4771,618,234,00051,879,0002,875,392