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 27, 2026 22:29TudyMTudyMScore: 15,350Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 22:3514,958448,766,6451,244,875,00035,967,0003,096,576
2Apr 27, 2026 22:3514,983449,505,3541,232,661,00048,907,0002,646,016
3Apr 27, 2026 22:3515,103453,112,7131,240,249,00042,904,0002,740,224
4Apr 27, 2026 22:3515,120453,601,5241,237,406,00044,978,0003,035,136
5Apr 27, 2026 22:3515,350460,500,5181,270,497,00049,901,0002,592,768
6Apr 27, 2026 22:3515,378461,346,1291,266,703,00049,948,0002,965,504
7Apr 27, 2026 22:3515,530465,925,7651,269,245,00051,846,0002,613,248
8Apr 27, 2026 22:3515,589467,670,5181,237,915,00043,961,0002,555,904
9Apr 27, 2026 22:3515,625468,760,4941,272,601,00046,985,0002,756,608