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 21:48TudyMTudyMScore: 20,035Success
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 21:5319,700591,012,6981,648,106,00053,003,0002,510,848
2Apr 27, 2026 21:5319,772593,164,3921,631,867,00061,956,0002,613,248
3Apr 27, 2026 21:5319,782593,465,5981,646,709,00057,989,0002,662,400
4Apr 27, 2026 21:5319,787593,631,1191,653,805,00050,963,0002,854,912
5Apr 27, 2026 21:5320,035601,075,8981,655,104,00049,942,0002,850,816
6Apr 27, 2026 21:5320,043601,294,5921,653,363,00052,979,0002,818,048
7Apr 27, 2026 21:5320,064601,938,3851,656,792,00053,993,0002,674,688
8Apr 27, 2026 21:5320,213606,410,2551,684,685,00058,953,0002,887,680
9Apr 27, 2026 21:5321,475644,270,8581,808,112,00049,947,0002,867,200