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 13:29Dominique GarmierDominique GarmierScore: 12,721Success
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 13:2912,513375,416,4501,029,076,0009,991,0002,842,624
2Apr 28, 2026 13:2912,545376,356,1651,034,354,0009,984,0002,359,296
3Apr 28, 2026 13:2912,623378,690,1921,038,528,00011,971,0002,842,624
4Apr 28, 2026 13:2912,686380,608,3231,039,432,0009,984,0002,576,384
5Apr 28, 2026 13:2912,721381,640,9941,042,151,0009,982,0002,347,008
6Apr 28, 2026 13:2912,910387,326,5911,051,046,00010,979,0002,580,480
7Apr 28, 2026 13:2912,941388,259,1311,063,492,00011,971,0002,367,488
8Apr 28, 2026 13:2912,949388,499,4581,063,719,0008,989,0002,359,296
9Apr 28, 2026 13:2913,186395,586,3081,089,277,0007,987,0002,703,360