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 listDec 25, 2025 01:21Josu San MartinJosu San MartinScore: 18,226Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 25, 2025 01:2118,105543,138,0721,298,719,00092,051,0002,641,920
2Dec 25, 2025 01:2118,114543,434,7471,296,259,00098,943,0002,695,168
3Dec 25, 2025 01:2118,141544,219,0251,288,677,000107,889,0002,805,760
4Dec 25, 2025 01:2118,200545,987,6461,309,181,000100,936,0002,752,512
5Dec 25, 2025 01:2118,226546,775,8691,301,578,000103,886,0002,478,080
6Dec 25, 2025 01:2118,264547,918,7371,306,321,00094,878,0002,723,840
7Dec 25, 2025 01:2118,269548,058,3111,304,570,000103,886,0002,830,336
8Dec 25, 2025 01:2118,311549,338,1231,313,390,00085,960,0002,621,440
9Dec 25, 2025 01:2118,390551,712,9351,296,186,000107,015,0002,617,344