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 listMay 3, 2026 19:59TudyMTudyMScore: 39,499Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 20:0339,0231,170,712,2271,078,088,00077,168,0002,392,064
2May 3, 2026 20:0339,1051,173,166,4981,076,243,00078,981,0002,355,200
3May 3, 2026 20:0339,2681,178,045,0401,077,998,00079,971,0002,347,008
4May 3, 2026 20:0339,2991,178,975,4491,082,981,00080,131,0002,363,392
5May 3, 2026 20:0339,4991,184,970,8891,084,336,00081,288,0002,392,064
6May 3, 2026 20:0339,4991,184,985,1581,084,611,00081,851,0002,363,392
7May 3, 2026 20:0339,5161,185,492,6281,085,914,00079,689,0002,359,296
8May 3, 2026 20:0339,5661,187,002,2561,086,794,00079,270,0002,363,392
9May 3, 2026 20:0340,2321,206,962,3851,107,629,00080,273,0002,326,528