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:28TudyMTudyMScore: 15,486Success
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:3315,000450,025,6291,242,168,00042,005,0002,748,416
2Apr 27, 2026 22:3315,046451,393,7301,243,049,00046,001,0002,662,400
3Apr 27, 2026 22:3315,127453,830,5291,237,029,00049,001,0002,629,632
4Apr 27, 2026 22:3315,142454,280,5481,237,488,00049,019,0002,543,616
5Apr 27, 2026 22:3315,486464,581,3571,276,793,00048,953,0002,813,952
6Apr 27, 2026 22:3315,509465,270,4961,277,226,00046,934,0002,342,912
7Apr 27, 2026 22:3315,532465,960,5771,273,324,00049,934,0002,740,224
8Apr 27, 2026 22:3315,612468,388,1361,271,208,00042,973,0002,740,224
9Apr 27, 2026 22:3315,620468,620,9731,274,039,00044,966,0003,014,656