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:17TudyMTudyMScore: 15,425Success
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:2415,126453,807,1251,243,924,00041,030,0002,514,944
2Apr 27, 2026 22:2415,144454,345,4251,233,445,00048,017,0002,760,704
3Apr 27, 2026 22:2415,184455,529,7141,250,468,00036,984,0002,805,760
4Apr 27, 2026 22:2415,389461,670,7491,285,060,00031,976,0002,846,720
5Apr 27, 2026 22:2415,425462,773,6831,278,050,00036,943,0002,756,608
6Apr 27, 2026 22:2415,432462,973,3521,281,445,00036,955,0002,703,360
7Apr 27, 2026 22:2415,447463,411,5591,292,717,00028,971,0002,674,688
8Apr 27, 2026 22:2415,578467,344,9891,275,957,00040,902,0002,646,016
9Apr 27, 2026 22:2415,788473,668,1551,247,053,00047,963,0002,498,560