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 28, 2026 10:30Victor MerckléVictor MerckléScore: 10,047Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 10:319,683290,495,210772,179,00010,974,0002,584,576
2Apr 28, 2026 10:319,776293,295,495763,711,00020,937,0002,736,128
3Apr 28, 2026 10:319,786293,597,109765,341,00022,890,0002,838,528
4Apr 28, 2026 10:319,902297,077,357768,381,00010,976,0002,732,032
5Apr 28, 2026 10:3110,047301,427,350769,381,0008,981,0002,637,824
6Apr 28, 2026 10:3110,093302,792,996758,372,00016,941,0002,756,608
7Apr 28, 2026 10:3110,100303,019,678770,242,0008,979,0002,633,728
8Apr 28, 2026 10:3110,312309,380,234763,940,00010,970,0002,580,480
9Apr 28, 2026 10:3110,358310,761,521765,283,00012,970,0002,813,952