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 19:37TudyMTudyMScore: 18,672Success
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 19:3717,929537,872,3161,414,912,00035,972,0002,736,128
2Apr 26, 2026 19:3717,987539,610,0901,419,646,00038,962,0002,936,832
3Apr 26, 2026 19:3718,300549,000,7971,464,509,00028,990,0002,945,024
4Apr 26, 2026 19:3718,477554,322,7621,484,529,00032,967,0002,764,800
5Apr 26, 2026 19:3718,672560,171,2641,488,575,00028,991,0002,834,432
6Apr 26, 2026 19:3718,686560,594,9621,480,173,00034,003,0002,760,704
7Apr 26, 2026 19:3718,794563,822,2471,482,725,00037,992,0002,945,024
8Apr 26, 2026 19:3720,172605,174,2741,638,223,00031,965,0002,936,832
9Apr 26, 2026 19:3720,181605,448,4631,611,458,00034,923,0003,018,752