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 listMay 3, 2026 19:28TudyMTudyMScore: 75,939Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 19:3275,4832,264,493,6222,187,007,00060,572,0002,523,136
2May 3, 2026 19:3275,6252,268,760,7862,194,484,00058,603,0002,531,328
3May 3, 2026 19:3275,6642,269,947,5762,195,161,00058,268,0002,523,136
4May 3, 2026 19:3275,7972,273,920,6122,197,488,00059,889,0002,535,424
5May 3, 2026 19:3275,9392,278,190,4832,203,568,00059,356,0002,531,328
6May 3, 2026 19:3275,9762,279,302,2142,202,231,00059,628,0002,539,520
7May 3, 2026 19:3276,1822,285,465,1702,206,400,00059,703,0002,535,424
8May 3, 2026 19:3276,2432,287,295,5462,209,871,00061,615,0002,523,136
9May 3, 2026 19:3276,4412,293,259,1172,218,391,00059,314,0002,531,328