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:30Josu San MartinJosu San MartinScore: 26,358Success
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:3026,161784,831,2012,026,656,000153,822,0002,695,168
2Dec 25, 2025 03:5226,276788,268,5062,054,161,000154,710,0002,686,976
3Dec 25, 2025 03:5226,297788,898,0232,034,954,000139,722,0002,510,848
4Dec 25, 2025 03:5226,358790,741,5682,072,591,000142,765,0002,469,888
5Dec 25, 2025 01:3026,365790,942,4582,065,776,000143,775,0002,416,640
6Dec 25, 2025 01:3027,503825,087,3562,136,227,000147,601,0002,555,904